Sciweavers

14386 search results - page 331 / 2878
» The Chinese Generals Problem
Sort
View
146
Voted
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
15 years 7 months ago
Multi-objective memetic approach for flexible process sequencing problems
This paper describes a multi-objective memetic approach for solving multi-objective flexible process sequencing problems in flexible manufacturing systems (FMSs). FMS can be des...
Jian-Hong Chen, Jian-Hung Chen
CEC
2010
IEEE
15 years 6 months ago
Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
Liang Feng, Yew-Soon Ong, Quang Huy Nguyen 0001, A...
ALGORITHMICA
2007
89views more  ALGORITHMICA 2007»
15 years 6 months ago
The Complexity of the Single Individual SNP Haplotyping Problem
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John ...
127
Voted
EOR
2010
92views more  EOR 2010»
15 years 6 months ago
A survey of variants and extensions of the resource-constrained project scheduling problem
The resource-constrained project scheduling problem (RCPSP) consists of activities that must be scheduled subject to precedence and resource constraints such that the makespan is ...
Sönke Hartmann, Dirk Briskorn
EJC
2008
15 years 6 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias