Sciweavers

16596 search results - page 34 / 3320
» Generalized Assignment Problems
Sort
View
CIAC
2006
Springer
106views Algorithms» more  CIAC 2006»
15 years 1 months ago
On the Hardness of Range Assignment Problems
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
Bernhard Fuchs
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
14 years 10 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
EMO
2006
Springer
122views Optimization» more  EMO 2006»
15 years 1 months ago
Substitute Distance Assignments in NSGA-II for Handling Many-objective Optimization Problems
Many-objective optimization refers to optimization problems with a number of objectives considerably larger than two or three. In this paper, a study on the performance of the Fast...
Mario Köppen, Kaori Yoshida
ISCIS
2009
Springer
15 years 4 months ago
Channel assignment problem in cellular networks: A reactive tabu search approach
—The channel assignment problem (CAP) in cellular networks is concerned with the allocation and reuse of the frequency spectrum to the base stations in such a way that both the i...
Didem Gözüpek, Gaye Genç, Cem Ers...
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 3 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz