A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
Algorithmic Operations Research
The Boolean optimization problem (BOOP) is a highly useful formulation that embraces a variety of 0-1 integer programming problems, including weighted versions of covering, partitioning and maximum satisfiability problems. In 2006 an adaptive memory (tabu search) method for BOOP was introduced, and was proved to be effective compared to competing approaches. However, in the intervening years, major advances have taken place in exact solvers for integer programming problems, leading to widelyfatcat:qvebigaeoff7pjdpb3a7wxqzyq