Nondeterministic control for hybrid search

Constraints

Volumn 11, Issue 4, 2006, Pages 353-373

  Hentenryck, Pascal Van ^a   Michel, Laurent ^b  

^a BROWN UNIVERSITY   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

Checkpoint; Closure; Constraint language; Continuation; Hybrid search; Local search; Non determinism; Search procedure; Solution

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; CONTROL SYSTEM ANALYSIS; TREES (MATHEMATICS);

NON DETERMINISM; SEARCH PROCEDURE;

ALGORITHMS;

EID: 33751536675     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-006-9005-5     Document Type: Conference Paper

References (17)

1. Balas, A., & Vazacopoulos, E. (1998). Guided local search with shifting bottleneck for job shop scheduling. Manage. Sci. 44(2): 262-275.
2. Bent, R., & Van Hentenryck, P. (2004). A two-stage hybrid local search for the vehicle routing problem with time windows. Transp. Sci. 8(4): 51.5-530.
3. de Givry, S., & Jeannin, L. (2003). Tools: A library for partial and hybrid search methods. In CP-AI-OR'03, Montreal, Canada.
4. Laburthe, F., & Caseau, Y. (1998). SALSA: A language for search algorithms. In CP'98, Pisa, Italy.
5. Michel, L., & Van Hentenryck, P. (2002). A constraint-based architecture for local search. In OOPSLA'02., pages 101-110. Seattle, Washington.
6. Michel, L., & Van Hentenryck, P. (2004). A decomposition-based implementation of search strategies. ACM Trans. Comput. Log. 5(2): 351-383.
7. Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Manage. Sci. 42(6): 797-813.
8. Perron, L. (1999). Search procedures and parallelism in constraint programming. In CP'99, pages 346-360. Alexandra, Virginia.
9. Rousseau, L. M., Gendreau, M., & Pesant, G. (2002). Using constraint-based operators to solve the vehicle routing problem with time windows. Journal of Heuristics, 8: 43-58.
10. Schulte, C. (1997). Programming constraint inference engines. In CP'97, pages 519-533. Linz, Austria.
11. Schulte, C. (1999). Comparing trailing and copying for constraint programming. In ICLP-99, pages 275-289. Las Cruces, New Mexico.
12. Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In CP'98, pages 417-431. Pisa, Italy.
13. Van Hentenryck, P. (1999). The OPL optimization programming language. Cambridge, Massachusetts: MIT.
14. Van Hentenryck, P., & Michel, L. (2003). Control abstractions for local search. In CP'03, pages 65-80. Cork, Ireland.
15. Van Hentenryck, P., & Michel, L. (2004). Scheduling abstractions for local search. In CP-AI-OR'04, pages 319-334. Nice, France.
16. Van Hentenryck, P., Michel, L., & Liu, L. (2004). Constraint-based combinators for local search. In CP'04. Toronto, Canada.
17. Van Hentenryck, P., Perron, L., & Puget, J-F. (2000). Search and strategies in OPL. ACM Trans. Comput. Log. 1(2): 1-36.