Improved integer programming bounds using intersections of corner polyhedra

DOI10.1007/BF01580451MaRDI QIDQ4074667zbMATH OpenOpenAlexFDO

Authors David E. Bell, Marshall L. Fisher

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

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

Cites work

• scientific article; zbMATH DE number 3427119 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• An Adaptive Group Theoretic Algorithm for Integer Programming Problems
• Constructive Duality in Integer Programming
• Extensions of the Group Theoretic Approach in Integer Programming
• On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
• Some continuous functions related to corner polyhedra
• Some polyhedra related to combinatorial problems

Cited in

(4)

• A Theorem Concerning the Integer Lattice
• Symmetric duality for disjunctive programming with absolute value functionals
• \(\mathcal{V}\)-polyhedral disjunctive cuts
• Two-halfspace closure

This page was built for publication: Improved integer programming bounds using intersections of corner polyhedra

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