Negative-Cycle Detection Algorithms
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
iOpt: A Software Toolkit for Heuristic Search Methods
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
A Fast Parallel Dynasearch Algorithm for Some Scheduling Problems
PARELEC '06 Proceedings of the international symposium on Parallel Computing in Electrical Engineering
Fast and scalable domino portrait generation
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
| Hi-index | 0.00 |
This paper shows that that some matching based neighborhood can be automatically designed by searching for stable sets in a graph. This move generation algorithm is illustrated and investigated within the LocalSolver framework.