Maintaining longest paths incrementally

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 540-554

  Michel, Laurent ^a   Van Hentenryck, Pascal ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; DIRECTED GRAPHS; OPTIMIZATION;

DIRECTED ACYCLIC GRAPH (DAG); INCREMENTAL ALGORITHM; INPUT AND OUTPUTS; LONGEST PATH; NEIGHBORHOOD SEARCH; PROGRAMMING TOOLS; SCHEDULING APPLICATION;

GRAPH THEORY;

EID: 26444526552     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_37     Document Type: Article

References (23)

1. E. Aarts, P. van Laarhoven, J. Lenstra, and N. Ulder. A computational study of local search algorithms for job shop scheduling. ORSA Journal on Computing, 6:113-125, 1994.
2. B. Alpern, R. Hoover, B. Rosen, P. Sweeney, and K. Zadeck. Incremental Evaluation of Computational Circuits. In SODA-90, 1990.
3. C. Codognet and D. Diaz. Yet Another Local Search Method for Constraint Solving. In AAAI Fall Symposium on Using Uncertainty within Computation, Cape Cod, MA., 2001.
4. R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. In KR-89, 1989.
5. M. Dell'Amico and M. Trubian. Applying Tabu Search to the Job-Shop Scheduling Problem. Annals of Operations Research, 41:231-252, 1993.
6. L. Di Gaspero and A. Schaerf. Optimization Software Class Libraries, chapter Writing Local Search Algorithms Using EasyLocal++. Kluwer, 2002.
7. P. Galinier and J.-K. Hao. A General Approach for Constraint Solving by Local Search. In CP-AI-OR'00, Paderborn, Germany, March 2000.
8. P. Laburthe and Y. Caseau. SALSA: A Language for Search Algorithms. In CP'98, Pisa, Italy, October 1998.
9. L. Michel and P. Van Hentenryck. A Constraint-Based Architecture for Local Search. In OOPLSA'02, Seattle, WA, November 1992.
10. L. Michel and P. Van Hentenryck. Localizer. Constraints, 5:41-82, 2000.
11. L. Michel and P. Van Hentenryck. Localizer++: An Open Library for Local Search. Technical Report CS-01-02, Brown University, 2001.
12. L. Michel and P. Van Hentenryck. A simple tabu search for warehouse location. European Journal on Operations Research, 2001. (to appear).
13. E. Nowicki and C. Smutnicki. A fast taboo search algorithm for the job shop problem. Management Science, 42(6):797-813, 1996.
14. G. Ramalingam and T. Reps. An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms, 21:267-305, 1996.
15. G. Ramalingam and T. Reps. On the computational complexity of dynamic graph problems. Theoretical Computer Science, 158:233-277, 1996.
16. G. Ramalingam, J. Song, L. Joscovicz, and R. E. Miller. Solving difference constraints incrementally. Algorithmica, 23:261-275, 1999.
17. T. Reps. Optimal-Time Incremental Semantic Analysis for Syntax-Directed Editors. In POPL-82, 1982.
18. P. Shaw, B. De Backer, and V. Furnon. Improved local search for CP toolkits. Annals of Operations Research, 115:31-50, 2002.
19. R. Tarjan. Amortized Computational Complexity. SIAM Journal of Algebraic Discrete Methods, 6:306-318, 1985.
20. S. Voss and D. Woodruff. Optimization Software Class Libraries. Kluwer, 2002.
21. C. Voudouris, R. Dorne, D. Lesaint, and A. Liret. iOpt: A Software Toolkit for Heuristic Search Methods. In CP'01, Paphos, Cyprus, October 2001.
22. J. Walser. Integer Optimization by Local Search. Springer Verlag, 1998.
23. F. Werner and A. Winkler. Insertion techniques for the heuristic solution of the job-shop problem. Discrete Applied Mathematics, 58(2):191-211, 1995.