Sciweavers

242 search results - page 22 / 49
» Approximation Algorithms for Multi-Criteria Traveling Salesm...
Sort
View
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
14 years 9 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
CPAIOR
2004
Springer
15 years 3 months ago
A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
Christian Artigues, Sana Belmokhtar, Dominique Fei...
TCS
2008
14 years 9 months ago
On the power of lookahead in on-line server routing problems
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci,...
SASO
2007
IEEE
15 years 3 months ago
On Scaling Multi-Agent Task Reallocation Using Market-Based Approach
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
Rajesh K. Karmani, Timo Latvala, Gul Agha
JAR
2000
149views more  JAR 2000»
14 years 9 months ago
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
Patrick Mills, Edward P. K. Tsang