805 search results - page 60 / 161 » Combinatorial optimization problems in self-assembly |
103
Voted
EOR
2006
15 years 14 days ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
100
click to vote
KES
2008
Springer
15 years 12 days ago
2008
Springer
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimiza...
93
Voted
INFORMATICALT
2010
14 years 11 months ago
2010
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
113
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...