Compact LP bases for a class of IP problems

DOI10.1007/BF01593773zbMATH Open0361.90041OpenAlexW1999053816MaRDI QIDQ4135217FDOQ4135217

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized upper bounding techniques
• Title not available (Why is that?)
• New results on equivalent integer programming formulations
• Implicit representation of generalized variable upper bounds in linear programming
• A generalized upper bounding method for doubly coupled linear programs
• Integer Programming over a Finite Additive Group

Cited In (3)

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

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)