Sciweavers

359 search results - page 20 / 72
» A Hybrid Genetic Algorithm for the Quadratic Assignment Prob...
Sort
View
MP
2010
163views more  MP 2010»
13 years 3 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
14 years 1 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
14 years 1 months ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong
ISCIS
2009
Springer
14 years 3 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...
EC
2006
153views ECommerce» more  EC 2006»
13 years 8 months ago
GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem
This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossov...
Frédéric Lardeux, Frédé...