4432 search results - page 32 / 887 » Solving Demodulation as an Optimization Problem |
EUROCAST
2009
Springer
14 years 4 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...
IPCO
2008
13 years 11 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...
AAAI
2007
14 years 6 days ago
2007
A facility with front room and back room operations has the option of hiring specialized or, more expensive, cross-trained workers. Assuming stochastic customer arrival and servic...
CP
2009
Springer
14 years 10 months 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...
EVOW
2004
Springer
14 years 3 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, ...