Sciweavers

3367 search results - page 9 / 674
» Incremental assignment problem
Sort
View
GECCO
2006
Springer
216views Optimization» more  GECCO 2006»
15 years 1 months ago
Comparative analysis of the sailor assignment problem
In this work the performance of several local search and metaheuristic methods is compared to previously reported work using evolutionary algorithms. The results show that while m...
Joseph Vannucci, Deon Garrett, Dipankar Dasgupta
IPCO
1990
76views Optimization» more  IPCO 1990»
14 years 10 months ago
Probabilistic Analysis of the Generalised Assignment Problem
We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We show that such problems can be solved...
Martin E. Dyer, Alan M. Frieze
IPL
2006
101views more  IPL 2006»
14 years 9 months ago
An efficient approximation for the Generalized Assignment Problem
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
Reuven Cohen, Liran Katzir, Danny Raz
JAMDS
2002
155views more  JAMDS 2002»
14 years 9 months ago
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
Zvi Drezner
GECCO
2010
Springer
156views Optimization» more  GECCO 2010»
15 years 1 months ago
Elementary landscape decomposition of the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
J. Francisco Chicano, Gabriel Luque, Enrique Alba