Transformation of integer programs to knapsack problems
From MaRDI portal
Publication:2547181
Cites work
- Algorithm and bound for the greatest common divisor of n integers
- Equivalent Integer Programs and Canonical Problems
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- scientific article; zbMATH DE number 3212646 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Solution of a Large-Scale Traveling-Salesman Problem
Cited in
(35)- An integral transformation for integer programming problems
- A duality property for the set of all feasible solutions to an integer program
- 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
- Aggregation of equations in integer programming
- 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
- 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
- Solving the k-cardinality assignment problem by transformation
- New results for aggregating integer-valued equations
- Decomposing 1-Sperner hypergraphs
- Optimal constraints aggregation method for ILP
- scientific article; zbMATH DE number 444958 (Why is no real title available?)
- A note on aggregating constraints in integer programming
- Calculating surrogate constraints
- On Wilson's method for equivalent inequalities
- Coefficient reduction for inequalities in 0–1 variables
- New results on equivalent integer programming formulations
- Resolution of the 0–1 knapsack problem: Comparison of methods
- A method for reducing coefficients in zero‐one linear inequalities
- An algorithm for the 0/1 Knapsack problem
- Aggregating diophantine equations
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
- Solving large-scale linear programs by aggregation
- The support of bin packing is exponential
- Aggregation of nonnegative integer-valued equations
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems
- Knapsack polytopes: a survey
- Lattice based extended formulations for integer linear equality systems
This page was built for publication: Transformation of integer programs to knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2547181)
