Compact LP bases for a class of IP problems

DOI10.1007/BF01593773zbMath0361.90041OpenAlexW1999053816MaRDI QIDQ4135217

Fred Glover

Publication date: 1977

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

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

Mathematics Subject Classification ID

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

Related Items (3)

Dual simplex algorithm with implicit representation of variable upper bounds ⋮ An implementation of the simplex method for linear programming problems with variable upper bounds ⋮ A mixed-integer programming approach to the clustering problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized upper bounding techniques
• New results on equivalent integer programming formulations
• Implicit representation of generalized variable upper bounds in linear programming
• Integer Programming over a Finite Additive Group
• A generalized upper bounding method for doubly coupled linear programs

This page was built for publication: Compact LP bases for a class of IP problems