840 search results - page 144 / 168 » Inapproximability of Combinatorial Optimization Problems |
SAGT
2009
Springer
14 years 5 months ago
2009
Springer
In this paper we study a large class of resource allocation problems with an important complication, the utilization cost of a given resource is private information of a profit ma...
CISS
2008
IEEE
14 years 5 months ago
2008
IEEE
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
SLS
2007
Springer
14 years 5 months ago
2007
Springer
Stochastic Local Search (SLS) is quite effective for a variety of Combinatorial (Optimization) Problems (COP). However, the performance of SLS depends on several factors and getti...
UIST
2006
ACM
14 years 4 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...