Aggregation of equations in integer programming

DOI10.1016/0012-365X(74)90126-5zbMath0297.90054OpenAlexW2055956282MaRDI QIDQ1214343

Ivo G. Rosenberg

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1016/0012-365x(74)90126-5

Mathematics Subject Classification ID

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

Related Items (8)

Complexity of some parametric integer and network programming problems ⋮ Optimal constraints aggregation method for ILP ⋮ Some aspects of integer programming duality ⋮ On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes ⋮ How effective is aggregation for solving 0-1 models? ⋮ On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints ⋮ Solving network design problems via iterative aggregation ⋮ Decomposing 1-Sperner hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transformation of integer programs to knapsack problems
• Equivalent Integer Programs and Canonical Problems
• Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations
• Aggregating diophantine equations
• Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
• A note on equivalent systems of linear diophantine equations

This page was built for publication: Aggregation of equations in integer programming