A new reduction method in integer programming

DOI10.1016/0166-218X(88)90053-4zbMath0664.90063WikidataQ127629237 ScholiaQ127629237MaRDI QIDQ1115800

Harold Greenberg

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

constraint-reductionequivalent problem

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (3)

Sequential and simultaneous aggregation of diophantine equations ⋮ Sensitivity analysis for knapsack problems: A negative result ⋮ On aggregating two linear diophantine equations

Cites Work

• On the reduction method for integer linear programs. II
• New results on equivalent integer programming formulations

This page was built for publication: A new reduction method in integer programming