Sciweavers

Share
ANOR
2011
131views more  ANOR 2011»
9 years 3 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
CORR
2008
Springer
116views Education» more  CORR 2008»
9 years 8 months ago
Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
Mugurel Ionut Andreica
CPAIOR
2008
Springer
9 years 10 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
GECCO
2006
Springer
163views Optimization» more  GECCO 2006»
9 years 11 months ago
The quadratic multiple knapsack problem and three heuristic approaches to it
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
Amanda Hiley, Bryant A. Julstrom
GECCO
2005
Springer
219views Optimization» more  GECCO 2005»
10 years 1 months ago
An evolutionary lagrangian method for the 0/1 multiple knapsack problem
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
Yourim Yoon, Yong-Hyuk Kim, Byung Ro Moon
books