An Intersection Cut from the Dual of the Unit Hypercube

DOI10.1287/OPRE.19.1.40zbMATH Open0219.90036OpenAlexW2056782275MaRDI QIDQ5624985FDOQ5624985

Authors: E. Balas, V. Joseph Jun. Bowman, Fred Glover, David Sommer 

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

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

Cited In (6)

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

This page was built for publication: An Intersection Cut from the Dual of the Unit Hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5624985)