Sciweavers

137 search results - page 2 / 28
» An Improved Integer Local Search for Complex Scheduling Prob...
Sort
View
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 6 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
ECAIW
2000
Springer
13 years 10 months ago
Board-Laying Techniques Improve Local Search in Mixed Planning and Scheduling
When searching the space of possible plans for combined planning and scheduling problems we often reach a local maximum and must either backtrack or otherwise modify the plan to m...
Russell Knight, Gregg Rabideau, Steve A. Chien
HM
2007
Springer
135views Optimization» more  HM 2007»
14 years 9 days ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik
HM
2007
Springer
155views Optimization» more  HM 2007»
13 years 10 months ago
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with differe...
Alexandre R. Duarte, Celso C. Ribeiro, Sebasti&aac...
ECAI
2004
Springer
13 years 11 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière