Octane: A New Heuristic for Pure 0-1 Programs

Authors:
Egon Balas;Sebastián Ceria;Milind Dawande;Francois Margot;Gábor Pataki
Affiliations:
-;-;-;-;-
Venue:
Operations Research
Year:
2001

Citing 0
Cited 10

General Purpose Heuristics for Integer Programming—Part II

Journal of Heuristics
The probe metaheuristic and its application to the multiconstraint knapsack problem

Metaheuristics
Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming

Journal of Heuristics
Repairing MIP infeasibility through local branching

Computers and Operations Research
DINS, a MIP Improvement Heuristic

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Faster integer-feasibility in mixed-integer linear programs by branching to force change

Computers and Operations Research
An interior point cutting plane heuristic for mixed integer programming

Computers and Operations Research
A feasibility pump heuristic for general mixed-integer problems

Discrete Optimization
Improving the feasibility pump

Discrete Optimization
An empirical evaluation of walk-and-round heuristics for mixed integer linear programs

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.