A new dominance procedure for combinatorial optimization problems
- 31 August 1988
- journal article
- Published by Elsevier BV in Operations Research Letters
- Vol. 7 (4), 181-187
- https://doi.org/10.1016/0167-6377(88)90025-9
Abstract
It is known that the effectiveness of the branch and bound algorithms for combinatorial optimization problems can be improved through dominance criteria which allow fathomings of large solution subsets. We describe a new dominance procedure which overcomes some of the drawbacks of the commonly used dominance criteria. An application to the Multiple Knapsack Problem and some computational results are also reported.Keywords
This publication has 1 reference indexed in Scilit:
- Algorithm 632: A program for the 0–1 multiple knapsack problemACM Transactions on Mathematical Software, 1985