92 search results - page 10 / 19 » Evolving heuristically difficult instances of combinatorial ... |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
JUCS
2008
14 years 9 months ago
2008
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...
COR
2007
14 years 9 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...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
CISS
2010
IEEE
14 years 1 months ago
2010
IEEE
— AHNs are wireless networks operating without the benefits of network infrastructure (basestations) or centralized control. AHNs working with limited spectrum perform best when...