Compact LP bases for a class of IP problems

DOI10.1007/BF01593773MaRDI QIDQ4135217zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3550467 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• A generalized upper bounding method for doubly coupled linear programs
• Generalized upper bounding techniques
• Implicit representation of generalized variable upper bounds in linear programming
• Integer Programming over a Finite Additive Group
• New results on equivalent integer programming formulations

Cited in

(3)

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

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

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