An Intersection Cut from the Dual of the Unit Hypercube

DOI10.1287/opre.19.1.40zbMath0219.90036OpenAlexW2056782275MaRDI QIDQ5624985

Egon Balas, Fred Glover, David Sommer, V. Joseph Jun. Bowman

Publication date: 1971

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.19.1.40

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05)

Related Items

Cut search methods in integer programming, Integer programming and convex analysis: Intersection cuts from outer polars, First facets of the octahedron, Ranking the facets of the octahedron, Convergence of a subgradient method for computing the bound norm of matrices, Depth-optimized convexity cuts