Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
From MaRDI portal
Publication:5665017
DOI10.1002/nav.3800190410zbMath0251.90028OpenAlexW2065716551MaRDI QIDQ5665017
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
Related Items
Sequential and simultaneous aggregation of diophantine equations, On the reduction method for integer linear programs. II, Lattice based extended formulations for integer linear equality systems, New results for aggregating integer-valued equations, Aggregation of constraints in integer programming, A result in surrogate duality for certain integer programming problems, Sensitivity analysis for knapsack problems: A negative result, On aggregating two linear diophantine equations, Equivalent constraints for discrete sets, A number theoretic reformulation and decomposition method for integer programming, Coefficient reduction for inequalities in 0–1 variables, New results on equivalent integer programming formulations, An analytical comparison of different formulations of the travelling salesman problem, An analog of the Cook theorem for polytopes, The common face of some 0/1-polytopes with NP-complete nonadjacency relation, Aggregation of equations in integer programming, Decomposing 1-Sperner hypergraphs, Aggregation of nonnegative integer-valued equations
Cites Work
