A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A number theoretic reformulation and decomposition method for integer programming
1974
Discrete Mathematics
Integer prcgramsning problems. and especially knapsack and finite abelian group problems, can be exactly replar.ed by equivalent problems of "smaller" size. This reformulation theoretically provides a new m :thod of solution for such problems, but the main advantages lie in reducing coeffitient magnierlldes and in removing selected constraints, while a disadvantage ;s the large increase in the number qf variables. By modifying the dyne mic programming approach S,I as effectively to avoid
doi:10.1016/0012-365x(74)90046-6
fatcat:abdc2viukbg7ljoqss5b4vlk3q