Sciweavers

CPAIOR
2008
Springer
14 years 19 days ago
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gi...
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
14 years 26 days ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
AIPS
2007
14 years 1 months ago
Robust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
Hoong Chuin Lau, Thomas Ou, Fei Xiao
AAAI
2007
14 years 1 months ago
Synthesis of Constraint-Based Local Search Algorithms from High-Level Models
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and...
Pascal Van Hentenryck, Laurent D. Michel
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
14 years 2 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
14 years 2 months ago
On the analysis of the (1+1) memetic algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
Dirk Sudholt
CP
2006
Springer
14 years 2 months ago
Adaptive Clause Weight Redistribution
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abd...
HM
2007
Springer
155views Optimization» more  HM 2007»
14 years 2 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...
HM
2007
Springer
180views Optimization» more  HM 2007»
14 years 2 months ago
Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems
We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Wi...
Tonci Caric, Juraj Fosin, Ante Galic, Hrvoje Gold,...
EVOW
2007
Springer
14 years 2 months ago
An Evolutionary Approach to Computer-Aided Orchestration
In this paper we introduce an hybrid evolutionary algorithm for computer-aided orchestration. Our current approach to orchestration consists in replicating a target sound with a se...
Grégoire Carpentier, Damien Tardieu, G&eacu...