Sciweavers

1054 search results - page 14 / 211
» Capacitated Domination Problem
Sort
View
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
13 years 11 months ago
Dominance learning in diploid genetic algorithms for dynamic optimization problems
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
Shengxiang Yang
MP
2002
96views more  MP 2002»
13 years 7 months ago
On capacitated network design cut-set polyhedra
Abstract. This paper provides an analysis of capacitated network design cut
Alper Atamtürk
COR
2008
80views more  COR 2008»
13 years 7 months ago
Multi-period capacitated location with modular equipments
This work deals with a multi-period capacitated location problem inspired by telecommunication access network planning problems, where demands and costs vary from one period to an...
Éric Gourdin, Olivier Klopfenstein
ICALP
2007
Springer
14 years 1 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier