Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem

DOI10.1023/A:1022632713397zbMath0908.90193OpenAlexW106943091MaRDI QIDQ1265040

N. A. Bryson, Saul I. Gass, Anito Joseph

Publication date: 28 February 1999

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022632713397

zbMATH Keywords

integer programmingextreme pointssolution boundsrelaxed linear-programming problems

Mathematics Subject Classification ID

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

Cites Work

• Parametric formulation of the general integer linear programming problem
• Integer Rounding for Polymatroid and Branching Optimization Problems
• All-integer linear programming — a new approach via dynamic programming

This page was built for publication: Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem