Maintaining longest paths incrementally

Constraints

Volumn 10, Issue 2, 2005, Pages 159-183

  Katriel, Irit ^a   Michel, Laurent ^b   Van Hentenryck, Pascal ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF CONNECTICUT   (United States)

^c BROWN UNIVERSITY   (United States)

Author keywords

Bounded computation; Constraint; Graph; Heaviest path; Incremental; Local search; Longest path; Scheduling

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; SCHEDULING;

BOUNDED COMPUTATION; HEAVIEST PATH; INCREMENTAL; LOCAL SEARCH; LONGEST PATH;

CONSTRAINT THEORY;

EID: 17444415666     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10601-005-0554-9     Document Type: Conference Paper

References (28)

1. Aarts, E., van Laarhoven, P., Lenstra, J., & Ulder, N. (1994). A computational study of local search algorithms for job shop scheduling. ORSA J. Comput. 6: 113 125.
2. Alpem, B., Carle, A., Rosen, B., Sweeney, P., & Zadeck, K. (1990). Incremental evaluation of computational circuits. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-90), San Francisco, California (January).
3. Codognet, C., & Diaz, D. (2001). Yet another local search method for constraint solving. In Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications (SAGA 2001), Berlin, Germany (December), pages 73 90.
4. Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artif. Intell. 49: 61 95.
5. Dell'Amico, M., & Trubian, M. (1993). Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. 41: 231 252.
6. Fredman, M. L., & Tarjan, R. E. (1987). Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34: 596 615.
7. Di Gaspero, L., & Schaerf, A. (2002). Optimization Software Class Libraries, chapter Writing Local Search Algorithms Using EasyLocal++. Kluwer, Boston.
8. Galinier, P., & Hao, J.-K. (2000). A general approach for constraint solving by local search. In CP-AI-OR '00, Paderborn, Germany (March).
9. Katriel, I. (2004). Dynamic heaviest paths in DAGs with arbitrary edge weights. In CP-AI-OR '04, Springer Verlag, Nice, France (April).
10. Katriel, I., & Bodlaender, H. L. (2005). Online topological ordering. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-2005), Vancouver, Canada.
11. Laburthe, F., & Caseau, Y. (1998). SALSA: A language for search algorithms. In CP'98, Springer Verlag, Pisa, Italy (October).
12. Michel, L., & Van Hentenryck, P. (1992). A constraint-based architecture for local search. In OOPLSA '02, Seattle, WA (November). ACM SIGPLAN Notices, ACM Press, New York (2002).
13. Michel, L., & Van Hentenryck, P. (2000). Localizer. Constraints 5: 41 82.
14. Michel, L., & Van Hentenryck, P. (2001). Localizer++: An open library for local search. Technical Report CS-01-02, Brown University.
15. Michel, L., & Van Hentenryck, P. (2003). Maintaining longest path incrementally. In CP'03, Kinsale, Ireland (September).
16. Michel, L., & Van Hentenryck, P. (2004). A simple tabu search for warehouse location. Eur. J. Oper. Res. 157/3: 576 591.
17. Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Manage. Sci. 42(6): 797 813.
18. Ramalingim, G., & Reps, T. (1996). An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21: 267 305.
19. Ramalingam, G., & Reps, T. (1996). On the computational complexity of dynamic graph problems. Theor. Comput. Sci. 158: 233 277.
20. Ramalingam, G., Song, J., Joscovicz, L., & Miller, R. E. (1999). Solving difference constraints incrementally. Algorithmica 23: 261 275.
21. Reps, T. (1982). Optimal-time incremental semantic analysis for syntax-directed editors. In Proceedings of the 9th ACM Symposium on Principles of Programming Languages (POPL-82), ACM Press.
22. Shaw, P., De Backer, B., & Furnon, V. (2002). Improved local search for CP toolkits. Ann. Oper. Res. 115: 31 50.
23. Tarjan, R. (1985). Amortized computational complexity. SIAM J. Algebr. Discrete Methods 6: 306 318.
24. Thorup, M. (2003). Integer priority queues with decrease key in constant time and the single source shortest paths problems. In Proc. of the 35th ACM Symp. on Theory of Computing (STOC), pages 149 158.
25. Voss, S., & Woodruff, D. (2002). Optimization Software Class Libraries. Kluwer, Boston.
26. Voudouris, C., Dorne, R., Lesaint, D., & Liret, A. (2001). iOpt: A software toolkit for heuristic search methods. In CP'01, Springer Verlag, Paphos, Cyprus (October).
27. Walser, J. (1998). Integer Optimization by Local Search. Springer Verlag, Berlin.
28. Werner, F., & Winkler, A. (1995). Insertion techniques for the heuristic solution of the job-shop problem. Discrete Appl. Math. 58(2): 191 211.