805 search results - page 3 / 161 » Combinatorial optimization problems in self-assembly |
CEC
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
HM
2007
Springer
14 years 12 days ago
2007
Springer
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
CEC
2008
IEEE
14 years 3 months ago
2008
IEEE
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...