A number theoretic reformulation and decomposition method for integer programming
β Scribed by Laurence A. Wolsey
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 759 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 generatin; a largl number of these neu variables, an algorithm to overcome this difficulty is.develaped. Ap plie;i to the solution of I:upe non-Erime group problems tiis provides an algorithm that appears on average to compare :a\ jurably with the deterministic L,.lgorithms of Hu and Gcmolry. * Origin21 vers,on rec+cd L May 1972.
π SIMILAR VOLUMES