Octane: A new heuristic for pure 0-1 programs
成果类型：
Article
署名作者：
Balas, E; Ceria, S; Dawande, M; Margot, F; Pataki, G
署名单位：
Carnegie Mellon University; Columbia University; University of Texas System; University of Texas Dallas; University of Kentucky; University of North Carolina; University of North Carolina Chapel Hill
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.49.2.207.13535
发表日期：
2001
页码：
207-225
关键词：
摘要：
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 rye 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 MILPLIB and other sources.