805 search results - page 56 / 161 » Combinatorial optimization problems in self-assembly |
ECAI
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
COR
2007
13 years 11 months ago
2007
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...
ANOR
2011
13 years 6 months ago
2011
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
EUROCAST
2009
Springer
14 years 5 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
EVOW
2007
Springer
14 years 5 months ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...