34 search results - page 2 / 7 » New Generic Algorithms for Hard Knapsacks |
CPAIOR
2008
Springer
13 years 7 months ago
2008
Springer
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...
MOR
2002
13 years 5 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
HEURISTICS
2006
13 years 5 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
EVOW
2008
Springer
13 years 7 months ago
2008
Springer
Recently, a new iterative optimization framework utilizing an evolutionary algorithm called "Prototype Optimization with Evolved iMprovement Steps" (POEMS) was introduced...
ECCV
1996
Springer
14 years 7 months ago
1996
Springer
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...