Sciweavers

Share
CPAIOR
2008
Springer

Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver

9 years 8 months ago
Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, branch-and-bound algorithm. In this paper, we propose path-symmetry and path-dominance, which are instances of the symmetry detection by dominance detection approach for pruning symmetric nodes in the MKP branch-and-bound search space. In addition, we integrate the "bound-and-bound" upper bound validation technique used in MKP solvers from the OR literature. We show experimentally that our new MKP solver, which integrates symmetry techniques from constraint programming and bound-and-bound techniques from operations research, significantly outperforms previous solvers on hard instances.
Alex S. Fukunaga
Added 18 Oct 2010
Updated 18 Oct 2010
Type Conference
Year 2008
Where CPAIOR
Authors Alex S. Fukunaga
Comments (0)
books