A New Local Search Algorithm for Binary Optimization

References

• Aarts E, Lenstra JK. Local Search in Combinatorial Optimization (1997) (John Wiley & Sons, New York) Google Scholar
• Achterberg T, Koch T, Martin A. MIPLIB 2003. Oper. Res. Lett. (2006) 34(4):361–372Crossref, Google Scholar
• Aickelin U. An indirect genetic algorithm for set covering problems. J. Oper. Res. Society (2002) 53(10):1118–1126Crossref, Google Scholar
• Al-Sultan KS, Hussain MF, Nizami JS. A genetic algorithm for the set covering problem. J. Oper. Res. Society (1996) 47(5):702–709Crossref, Google Scholar
• Arkin EM, Hassin R. On local search for weighted k-set packing. Math. Oper. Res. (1998) 23(1):640–648Link, Google Scholar
• Bakhtiari S, Safavi-Naini R, Pieprzyk J. Cryptographic hash functions: A survey. (1995) . Technical Report 95-09, Department of Computer Science, University of WollongongGoogle Scholar
• Balas E, Ho A. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study. Combinatorial Optimization (1980) 12(Springer, Berlin, Heidelberg) 37–60Mathematical Programming StudiesCrossref, Google Scholar
• Balas E, Martin CH. Pivot and complement–a heuristic for 0–1 programming. Management Sci. (1980) 26(1):86–96Link, Google Scholar
• Balas E, Ceria S, Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0–1 programs. Math. Programming (1993) 58(1-3):295–324Crossref, Google Scholar
• Beasley JE. A Lagrangian heuristic for set-covering problems. Naval Res. Logist. (1990) 37(1):151–164Crossref, Google Scholar
• Caprara A, Fischetti M, Toth P. A heuristic method for the set covering problem. Oper. Res. (1999) 47(5):730–743Link, Google Scholar
• Caprara A, Toth P, Fischetti M. Algorithms for the set covering problem. Annals Oper. Res. (2000) 98(1):353–371Crossref, Google Scholar
• Chu PC, Beasley JE. A genetic algorithm for the set covering problem. Eur. J. Oper. Res. (1996) 94(2):392–404Crossref, Google Scholar
• Cormen TH, Stein C, Rivest RL, Leiserson CE. Introduction to Algorithms (2001) (MIT Press, Cambridge, MA) Google Scholar
• Eckstein J, Nediak M. Pivot, cut, and dive: A heuristic for 0–1 mixed integer programming. J. Heuristics (2007) 13(5):471–503Crossref, Google Scholar
• Fischetti M, Glover F, Lodi A. The feasibility pump. Math. Programming (2005) 104(1):91–104Crossref, Google Scholar
• Hurkens CAJ, Schrijver A. On the size of systems of sets every t of which have an sdr, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Discret. Math. (1989) 2(1):68–72Crossref, Google Scholar
• Jia W, Zhang C, Chen J. An efficient parameterized algorithm for m-set packing. J. Algorithms (2004) 50(1):106–117Crossref, Google Scholar
• Koutis I. A faster parameterized algorithm for set packing. Inform. Processing Lett. (2005) 94(1):7–9Crossref, Google Scholar