Login / Signup
Using local search to speed up filtering algorithms for some NP-hard constraints.
Philippe Galinier
Alain Hertz
Sandrine Paroz
Gilles Pesant
Published in:
Ann. Oper. Res. (2011)
Keyphrases
</>
hard constraints
computational complexity
search algorithm
genetic algorithm
special case
np complete
heuristic methods
search space
optimization problems
computationally efficient
combinatorial optimization
soft constraints