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