New results on equivalent integer programming formulations

DOI10.1007/BF01580429zbMath0303.90040OpenAlexW1990872889MaRDI QIDQ4058477

Fred Glover

Publication date: 1975

Published in: Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (13)

Sequential and simultaneous aggregation of diophantine equations ⋮ On the reduction method for integer linear programs. II ⋮ Representability in mixed integer programming. I: Characterization results ⋮ On the Mixed Binary Representability of Ellipsoidal Regions ⋮ New results for aggregating integer-valued equations ⋮ A new reduction method in integer programming ⋮ Sensitivity analysis for knapsack problems: A negative result ⋮ On aggregating two linear diophantine equations ⋮ Compact LP bases for a class of IP problems ⋮ A necessary and sufficient condition for the aggregation of linear Diophantine equations ⋮ Ellipsoidal mixed-integer representability ⋮ Representability of functions ⋮ Aggregation of nonnegative integer-valued equations

Cites Work

• Unnamed Item
• First facets of the octahedron
• Transformation of integer programs to knapsack problems
• Technical Note—Solving Integer Programming Problems by Aggregating Constraints
• Aggregating diophantine equations
• Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach

This page was built for publication: New results on equivalent integer programming formulations