Disco - Novo - GoGo integrating local search and complete search with restarts

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2006, Pages 1051-1056

  Sellmann, Meinolf ^a   Ansótegui̊, Carlos ^b  

^a Brown Univerity   (United States)

^b ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; HEURISTIC METHODS; NUMERICAL METHODS; PROBLEM SOLVING;

HYBRID ALGORITHMS; RANDOM VARIABLE SELECTION;

ONLINE SEARCHING;

EID: 33750739213     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. E. Balas and M. Carrera. A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research, 44:875-890, 1996.
2. K. Boese, A. Kahng, S. Muddu. A New Adaptive Multi-start Technique for Combinatorial Global Optimizations. Operations Research Letters, 16:101-113, 1994.
3. N. Eén and N. Sörensson. An Extensible SAT-solver. SAT, 502-518, 2003.
4. S.L. Epstein, E.C. Freuder, R. Wallace, A. Morozov, B. Samuels ACE, The Adaptive Constraint Engine. CP, LNCS 2470:525-540, 2002.
5. H. Fang and W. Ruml. Complete local search for prepositional satisfiability. National Conference on Artificial Intelligence, 161-167, 2004.
6. M. Fischetti and A. Lodi. Local branching. Mathematical Programming, B(98): 23-47, 2003.
7. F. Focacci, F. Laburthe, and A. Lodi. Local Search and Constraint Programming. http://citeseer.ist.psu.edu/focacci01local.html, 2001.
8. M.L. Ginsberg, J.M. Crawford, D.W. Etherington. Dynamic Backtracking. citeseer.ifi.unizh.ch/ginsberg96dynamic.html, 1996.
9. C.P. Gomes and M. Seilmann. Streamlined constraint reasoning. CP, LNCS 3258:274-289, 2004.
10. C.P. Gomes, B. Selman, N. Crato. Heavy-Tailed Distributions in Combinatorial Search. CP, LNCS 1330:121-135, 1997.
11. D. Habet, L.M. Chu, L. Devendeville, M. Vasquez. A Hybrid Approach for SAT. CP, LNCS 2470:172-184, 2002.
12. W.D. Harvey and M.L. Ginsberg. Limited discrepancy search. International Joint Conference on Artificial Intelligence, 607-613, 1997.
13. P. Hansen and N. Mladenovic. A tutorial on Variable Neighborhood Search. Les cahiers du GERAD G-2003-46, Universite de Montreal HEC, Montreal, Canada, 2003.
14. J.P Hart and A.W. Shogan. Semi-greedy heuristics: An empirical study. Operations Research Letters, 6:107-114, 1987.
15. J.N. Hooker. A search-infer-and-relax framework for integrating solution methods. International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, LNCS 3524:243-257, 2005.
16. Dynamic Restart Policies. H. Kautz, E. Horvitz, Y. Ruan, C. Gomes, B. Selman. National Conference on Artificial Intelligence, 674-682, 2002.
17. H. Kautz and Y. Ruan and D. Achlioptas and C. Gomes and B. Selman and and M. Stickel. Balance and Filtering in Structured Satisfiable Problems. International Joint Conference on Artificial Intelligence, 193-200, 2001.
18. M. Luby, A. Sinclair, D. Zuckerman. Optimal speedup of las vegas algorithms. Information Processing Letters, 173-180, 1993.
19. J. Moran. The Wonders of Magic Squares. New York: Vintage, 1982.
20. L. Pitsoulis and M. Resende. Greedy randomized adaptive search procedures. Handbook of Applied Optimization 168-181, 2001.
21. S. Prestwich. Randomised Backtracking for Linear PseudoBoolean Constraint Problems. International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, 7-19, 2002.
22. S. Prestwich. Stochastic Local Search in Constrained Spaces. Practical Applications of Constraint Technology and Logic Programming, 27-39, 2000.
23. B. Selman and H. Levesque and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. National Conference on Artificial Intelligence, 440-446, 1992.
24. P. Shaw. Comparison of Search Methods for the Talent Scheduling Problem, Informs Proceedings, 2005.
25. P. Shaw. A new local search algorithm providing high quality solutions to vehicle routing problems. Technical report, APES group, Department of Computer Sciences, University of Strathclyde, 1997.
26. H. Shen and H. Zhang. Another Complete Local Search Method for SAT. Logic for Programming Artificial Intelligence and Reasoning, 2005.
27. P. Van Hentenryck and L. Michel. Constraint-Based Local Search, The MIT Press, 2005.
28. A. Vidotto, K.N. Brown, J.C. Beck. Robust Constraint Solving Using Multiple Heuristics. Irish Artificial Intelligence and Cognitive Science Conference, 203-212, 2005.