Equivalent knapsack-type formulations of bounded integer linear programs: An alternative approach |
| |
Authors: | Manfred W. Padberg |
| |
Abstract: | In this paper we show that every bounded integer linear program can be transformed into an integer program involving one single linear constraint and upper and lower bounds on the variables, such that the solution space of the original problem coincides with that one of the equivalent knapsack-type problem. |
| |
Keywords: | |
|
|