Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming
- 7 April 2007
- journal article
- Published by Springer Nature in Journal of Heuristics
- Vol. 13 (5) , 471-503
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- On the convergence of the modified tui algorithm for minimizing a concave function on a bounded convex polyhedron2005
- Octane: A New Heuristic for Pure 0–1 ProgramsOperations Research, 2001
- Pico: An Object-Oriented Framework for Parallel Branch and Bound2001
- Tabu Search1997
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- Branch and Bound Methods for Mathematical Programming Systems1979
- A heuristic algorithm for mixed-integer programming problems1974
- Integer programming and convex analysis: Intersection cuts from outer polarsMathematical Programming, 1972
- An Intersection Cut from the Dual of the Unit HypercubeOperations Research, 1971
- Intersection Cuts—A New Type of Cutting Planes for Integer ProgrammingOperations Research, 1971