4430 search results - page 33 / 886 » Solving Optimization Problems with DLL |
100
click to vote
EUROCAST
2009
Springer
15 years 6 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...
122
click to vote
IPCO
2008
15 years 1 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
172
click to vote
CP
2009
Springer
16 years 11 days ago
2009
Springer
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
110
click to vote
EVOW
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of finding two-dimensional cutting patterns for glass sheets in order to produce rectangular elements requested by customers. The number of needed sheets, ...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
A key problem in multi-agent systems research is identifying appropriate techniques to facilitate effective cooperation between agents. In this paper, we investigate the efficacy o...