New results on equivalent integer programming formulations
From MaRDI portal
Publication:4058477
DOI10.1007/BF01580429zbMATH Open0303.90040OpenAlexW1990872889MaRDI QIDQ4058477FDOQ4058477
Publication date: 1975
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580429
Cites Work
- Technical Note—Solving Integer Programming Problems by Aggregating Constraints
- Transformation of integer programs to knapsack problems
- Aggregating diophantine equations
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
- Title not available (Why is that?)
- First facets of the octahedron
Cited In (13)
- On aggregating two linear diophantine equations
- New results for aggregating integer-valued equations
- A new reduction method in integer programming
- Representability in mixed integer programming. I: Characterization results
- Compact LP bases for a class of IP problems
- Representability of functions
- A necessary and sufficient condition for the aggregation of linear Diophantine equations
- Ellipsoidal mixed-integer representability
- Sensitivity analysis for knapsack problems: A negative result
- Aggregation of nonnegative integer-valued equations
- Sequential and simultaneous aggregation of diophantine equations
- On the reduction method for integer linear programs. II
- 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)
