Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
From MaRDI portal
Publication:5665017
DOI10.1002/NAV.3800190410zbMATH Open0251.90028OpenAlexW2065716551MaRDI QIDQ5665017FDOQ5665017
Authors: Manfred Padberg 
Publication date: 1972
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800190410
Cites Work
Cited In (19)
- On aggregating two linear diophantine equations
- New results for aggregating integer-valued equations
- A number theoretic reformulation and decomposition method for integer programming
- Lattice based extended formulations for integer linear equality systems
- A result in surrogate duality for certain integer programming problems
- An analytical comparison of different formulations of the travelling salesman problem
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation
- An analog of the Cook theorem for polytopes
- Equivalent constraints for discrete sets
- New results on equivalent integer programming formulations
- Decomposing 1-Sperner hypergraphs
- Coefficient reduction for inequalities in 0–1 variables
- Sensitivity analysis for knapsack problems: A negative result
- Aggregation of nonnegative integer-valued equations
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- Aggregation of constraints in integer programming
- Sequential and simultaneous aggregation of diophantine equations
- Aggregation of equations in integer programming
- On the reduction method for integer linear programs. II
This page was built for publication: Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5665017)
