Improved integer programming bounds using intersections of corner polyhedra

DOI10.1007/BF01580451zbMATH Open0314.90058OpenAlexW2154792656MaRDI QIDQ4074667FDOQ4074667

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

• Some polyhedra related to combinatorial problems
• Some continuous functions related to corner polyhedra
• Title not available (Why is that?)
• Constructive Duality in Integer Programming
• An Adaptive Group Theoretic Algorithm for Integer Programming Problems
• On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
• Title not available (Why is that?)
• Extensions of the Group Theoretic Approach in Integer Programming

Cited In (3)

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

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)