Improved integer programming bounds using intersections of corner polyhedra

DOI10.1007/BF01580451zbMath0314.90058OpenAlexW2154792656MaRDI QIDQ4074667

Marshall L. Fisher, David E. Bell

Publication date: 1975

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580451

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items

Symmetric duality for disjunctive programming with absolute value functionals ⋮ Two-halfspace closure ⋮ A Theorem Concerning the Integer Lattice

Cites Work

• Unnamed Item
• Unnamed Item
• Some polyhedra related to combinatorial problems
• Constructive Duality in Integer Programming
• On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
• An Adaptive Group Theoretic Algorithm for Integer Programming Problems
• Extensions of the Group Theoretic Approach in Integer Programming
• Some continuous functions related to corner polyhedra