Transformation of integer programs to knapsack problems

DOI10.1016/0012-365X(71)90005-7zbMath0219.90033MaRDI QIDQ2547181

Gordon H. Bradley

Publication date: 1971

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Sequential and simultaneous aggregation of diophantine equations, A duality property for the set of all feasible solutions to an integer program, Knapsack polytopes: a survey, On the reduction method for integer linear programs. II, A note on aggregating constraints in integer programming, 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, Optimal constraints aggregation method for ILP, Equivalent constraints for discrete sets, A number theoretic reformulation and decomposition method for integer programming, Aggregating diophantine equations, Coefficient reduction for inequalities in 0–1 variables, Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach, New results on equivalent integer programming formulations, Resolution of the 0–1 knapsack problem: Comparison of methods, Aggregation of equations in integer programming, A method for reducing coefficients in zero‐one linear inequalities, An algorithm for the 0/1 Knapsack problem, Solving large-scale linear programs by aggregation, A necessary and sufficient condition for the aggregation of linear Diophantine equations, Representations of unbounded optimization problems as integer programs, A spectral algorithm for sequential aggregation of m linear diophantine constraints, Decomposing 1-Sperner hypergraphs, Calculating surrogate constraints, Aggregation of nonnegative integer-valued equations, A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems, On Wilson's method for equivalent inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Solution of a Large-Scale Traveling-Salesman Problem
• Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem
• Algorithm and bound for the greatest common divisor of n integers
• Equivalent Integer Programs and Canonical Problems