New results for aggregating integer-valued equations

DOI10.1007/BF02032133zbMath0836.11010OpenAlexW2030960960MaRDI QIDQ1904718

Fred Glover, Djangir A. Babayev

Publication date: 11 February 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

aggregationlinear diophantine equationsinteger knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Linear Diophantine equations (11D04)

Related Items (5)

Iterative variable aggregation and disaggregation in IP: an application ⋮ Sensitivity analysis for knapsack problems: A negative result ⋮ On aggregating two linear diophantine equations ⋮ Optimal constraints aggregation method for ILP ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models

Cites Work

• Unnamed Item
• Unnamed Item
• Aggregation of nonnegative integer-valued equations
• On the reduction method for integer linear programs. II
• Sequential and simultaneous aggregation of diophantine equations
• Transformation of integer programs to knapsack problems
• New results on equivalent integer programming formulations
• Aggregation of a class of systems of integer-valued equations
• Aggregating diophantine equations
• Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach

This page was built for publication: New results for aggregating integer-valued equations