Octane: A new heuristic for pure 0-1 programs. We propose a new heuristic for pure 0-1 programs, which finds feasible integer points by enumerating extended facets of the octahedron, the outer polar of the unit hypercube. We give efficient algorithms to carry out the enumeration, and we explain how our heuristic can be embedded in a branch-and-cut framework. Finally, we present computational results on a set of pure 0-1 programs taken from MIPLIB and other sources.

References in zbMATH (referenced in 24 articles , 1 standard article )

Showing results 1 to 20 of 24.
Sorted by year (citations)

1 2 next

  1. Yu, Jing; Anitescu, Mihai: Multidimensional sum-up rounding for integer programming in optimal experimental design (2021)
  2. Munguía, Lluís-Miquel; Ahmed, Shabbir; Bader, David A.; Nemhauser, George L.; Shao, Yufen: Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (2018)
  3. Guastaroba, G.; Savelsbergh, M.; Speranza, M. G.: Adaptive kernel search: a heuristic for solving mixed integer linear programs (2017)
  4. Hanafi, Saïd; Todosijević, Raca: Mathematical programming based heuristics for the 0--1 MIP: a survey (2017)
  5. Koc, Utku; Mehrotra, Sanjay: Generation of feasible integer solutions on a massively parallel computer using the feasibility pump (2017)
  6. Berthold, Timo; Hendel, Gregor: Shift-and-propagate (2015)
  7. Huang, Kuo-Ling; Mehrotra, Sanjay: An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (2015)
  8. Berthold, Timo: RENS. The optimal rounding (2014)
  9. Huang, Kuo-Ling; Mehrotra, Sanjay: An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (2013)
  10. Naoum-Sawaya, Joe; Elhedhli, Samir: An interior point cutting plane heuristic for mixed integer programming (2011)
  11. Pryor, Jennifer; Chinneck, John W.: Faster integer-feasibility in mixed-integer linear programs by branching to force change (2011)
  12. Sacchi, Luís Henrique; Armentano, Vinícius Amaral: A computational study of parametric tabu search for 0-1 mixed integer programs (2011)
  13. Akartunalı, Kerem; Miller, Andrew J.: A heuristic approach for big bucket multi-level production planning problems (2009)
  14. Fischetti, Matteo; Salvagnin, Domenico: Feasibility pump 2.0 (2009)
  15. Fischetti, Matteo; Lodi, Andrea: Repairing MIP infeasibility through local branching (2008)
  16. Achterberg, Tobias; Berthold, Timo: Improving the feasibility pump (2007)
  17. Bertacco, Livio; Fischetti, Matteo; Lodi, Andrea: A feasibility pump heuristic for general mixed-integer problems (2007)
  18. Patel, Jagat; Chinneck, John W.: Active-constraint variable ordering for faster feasibility of mixed integer linear programs (2007)
  19. Danna, Emilie; Rothberg, Edward; Le Pape, Claude: Exploring relaxation induced neighborhoods to improve MIP solutions (2005)
  20. Escudero, Laureano F.; Salmeron, Javier: On a fix-and-relax framework for a class of project scheduling problems (2005)

1 2 next