805 search results - page 51 / 161 » Combinatorial optimization problems in self-assembly |
GECCO
2005
Springer
14 years 4 months ago
2005
Springer
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
EVOW
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. A methodology is presented for tackling mixed-integer nonlinear optimization problems by local search, in particular large-scale real-life problems. This methodology is i...
STOC
2005
ACM
14 years 11 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
STOC
2004
ACM
14 years 11 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
NHM
2010
13 years 5 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...