805 search results - page 2 / 161 » Combinatorial optimization problems in self-assembly |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
WEA
2004
Springer
13 years 11 months ago
2004
Springer
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
STOC
2002
ACM
14 years 6 months ago
2002
ACM
OL
2010
13 years 4 months ago
2010
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
4OR
2007
13 years 6 months ago
2007
The purpose of this paper is to illustrate the diversity of combinatorial problems encountered in the design of wireless switching systems. This is done via a representative selec...