Sciweavers

Share
2 search results - page 1 / 1
» Integrating Symmetry, Dominance, and Bound-and-Bound in a Mu...
Sort
View
CPAIOR
2008
Springer
9 years 11 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, b...
Alex S. Fukunaga
ANOR
2011
131views more  ANOR 2011»
9 years 4 months ago
A branch-and-bound algorithm for hard multiple knapsack problems
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, br...
Alex S. Fukunaga
books