On convergence of scatter search and star paths with directional rounding for 0–1 mixed integer programs

Aboudi, 1989, A note on the pivot and complement heuristic for 0–1 programming problems, Oper. Res. Lett., 8, 21, 10.1016/0167-6377(89)90028-X Achterberg, 2007, Improving the feasibility pump, Discrete Optim., 4, 77, 10.1016/j.disopt.2006.10.004 Balas, 1971, The intersection cut–A new cutting plane for integer programming, Oper. Res., 19, 19, 10.1287/opre.19.1.19 Balas, 1993, A lift-and-project cutting plane algorithm for mixed 0–1 programs, Math. Program., 58, 295, 10.1007/BF01581273 Balas, 2001, OCTANE: A new heuristic for pure 0-1 programs, Oper. Res., 49, 207, 10.1287/opre.49.2.207.13535 Balas, 2013, Generalized intersection cuts and a new cut generating paradigm, Math. Program., 137, 19, 10.1007/s10107-011-0483-x Balas, 1980, Pivot and complement-a heuristic for 0–1 programming, Manag. Sci., 26, 86, 10.1287/mnsc.26.1.86 Balas, 2004, Pivot and shift-a mixed integer programming heuristic, Discrete Optim., 1, 3, 10.1016/j.disopt.2004.03.001 Bertacco, 2007, A feasibility pump heuristic for general mixed-integer problems, Discrete Optim., 4, 63, 10.1016/j.disopt.2006.10.001 Brimberg, 2010, Attraction probabilities in variable neighborhood search, 4OR, 8, 181, 10.1007/s10288-009-0108-x Danna, 2005, Exploring relaxation induced neighborhoods to improve MIP solutions, Math. Program., 102, 71, 10.1007/s10107-004-0518-7 Dantzig, 1963 Eckstein, 2007, Pivot, cut and dive: a heuristic for 0-1 mixed integer programming, J. Heuristics, 13, 471, 10.1007/s10732-007-9021-7 Fischetti, 2005, The feasibility pump, Math. Program., 104, 91, 10.1007/s10107-004-0570-3 Fischetti, 2003, Local branching, Math. Program., 98, 23, 10.1007/s10107-003-0395-5 Glover, 1965, A multiphase dual algorithm for the zero-one integer programming problem, Oper. Res., 13, 879, 10.1287/opre.13.6.879 Glover, 1972, Cut search methods in integer programming, Math. Program., 3, 86, 10.1007/BF01584977 Glover, 1977, Heuristics for integer programming using surrogate constraints, Decis. Sci., 8, 156, 10.1111/j.1540-5915.1977.tb01074.x Glover, 1995, Scatter search and star-paths: beyond the genetic metaphor, OR Spektrum, 17, 125, 10.1007/BF01719256 Glover, 1998, A template for scatter search and path relinking, 1 Glover, 1999, Scatter search and path relinking Glover, 2002, Tabu search and finite convergence, Discrete Appl. Math., 119, 3, 10.1016/S0166-218X(01)00263-3 Glover, 1997, General purpose heuristics for integer programming-Part II, J. Heuristics, 3, 161, 10.1023/A:1009631530787 Glover, 2000, Fundamentals of scatter search and path relinking, Control Cybernet., 29, 653 Glover, 2000, Scatter search González, 2015, Scatter search with path relinking for the flexible job shop scheduling problem, European J. Oper. Res., 245, 35, 10.1016/j.ejor.2015.02.052 Hanafi, 2001, On the convergence of tabu search, J. Heuristics, 7, 47, 10.1023/A:1026565712483 Hanafi, 2010, Variable neighbourhood pump heuristic for 0–1 mixed integer programming feasibility, Electron. Notes Discrete Math., 36, 759, 10.1016/j.endm.2010.05.096 Hanafi, 2010, Hybrid variable neighbourhood decomposition search for 0–1 mixed integer programming problem, Electron. Notes Discrete Math., 36, 883, 10.1016/j.endm.2010.05.112 Hanafi, 2011, Improved convergent heuristics for the 0-1 multidimensional knapsack problem, Ann. OR, 183, 125, 10.1007/s10479-009-0546-z Hansen, 2006, Variable neighborhood search and local branching, Comput. Oper. Res., 33, 3034, 10.1016/j.cor.2005.02.033 Khooban, 2015, Mixed network design using hybrid scatter search, European J. Oper. Res., 247, 699, 10.1016/j.ejor.2015.06.025 Laguna, 2003 Laguna, 2005, Experimental testing of advanced scatter search designs for global optimization of multimodal functions, J. Global Optim., 33, 235, 10.1007/s10898-004-1936-z Lasserre, 1983, An analytical expression and an algorithm for the volume of a convex polyhedron in Rn, Journal of optimization theory and applications, 39, 363, 10.1007/BF00934543 Lazić, 2010, Variable neighbourhood decomposition search for 0–1 mixed integer programs, Comput. Oper. Res., 37, 1055, 10.1016/j.cor.2009.09.010 Lazić, 2014 Lokketangen, 1998, Solving zero-one mixed integer programming problems using tabu search, European J. Oper. Res., 106, 624, 10.1016/S0377-2217(97)00295-6 Martí, 2015, Scatter search for an uncapacitated p-hub median problem, Comput. Oper. Res., 58, 53, 10.1016/j.cor.2014.12.009 Marti, 2006, Principles of scatter search, European J. Oper. Res., 169, 359, 10.1016/j.ejor.2004.08.004 Naderi, 2014, A scatter search algorithm for the distributed permutation flowshop scheduling problem, European J. Oper. Res., 239, 323, 10.1016/j.ejor.2014.05.024 Resende, 2010, Scatter search and path-relinking: Fundamentals, advances and applications, vol. 146, 87 R. Todosijević, S. Hanafi, F. Glover, Scatter search and star paths with directional rounding for 0–1 mixed integer programs: Heuristic algorithms. working paper. Tuy, 1964, Concave programming under linear constraints, Sov. Math., 1437 Wilbaut, 2009, New convergent heuristics for 0–1 mixed integer programming, European J. Oper. Res., 195, 62, 10.1016/j.ejor.2008.01.044 Wolsey, 1999 Young, 1971, Hypercylindrically deduced cuts in zero-one integer programs, Oper. Res., 19, 1393, 10.1287/opre.19.6.1393