New results on equivalent integer programming formulations

DOI10.1007/BF01580429MaRDI QIDQ4058477zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3463141 (Why is no real title available?)
• Aggregating diophantine equations
• Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
• First facets of the octahedron
• Technical Note—Solving Integer Programming Problems by Aggregating Constraints
• Transformation of integer programs to knapsack problems

Cited in

(13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4058477)