Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach

DOI10.1002/NAV.3800190410MaRDI QIDQ5665017zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Integer programming (90C10)

Cites work

• Transformation of integer programs to knapsack problems

Cited in

(19)

• Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
• An analytical comparison of different formulations of the travelling salesman problem
• The common face of some 0/1-polytopes with NP-complete nonadjacency relation
• On the reduction method for integer linear programs. II
• Sequential and simultaneous aggregation of diophantine equations
• On aggregating two linear diophantine equations
• An analog of the Cook theorem for polytopes
• Sensitivity analysis for knapsack problems: A negative result
• New results on equivalent integer programming formulations
• Aggregation of nonnegative integer-valued equations
• Decomposing 1-Sperner hypergraphs
• Equivalent constraints for discrete sets
• Aggregation of equations in integer programming
• A result in surrogate duality for certain integer programming problems
• Lattice based extended formulations for integer linear equality systems
• New results for aggregating integer-valued equations
• Aggregation of constraints in integer programming
• A number theoretic reformulation and decomposition method for integer programming
• Coefficient reduction for inequalities in 0–1 variables

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)