Cost-based filtering for shorter path constraints

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

Volumn 2833, Issue , 2003, Pages 694-708

  Sellmann, Meinolf ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; DIRECTED GRAPHS; TRANSPORTATION PERSONNEL;

CONSTRAINED SHORTEST PATH; CONSTRAINT PROGRAMMING; PROBLEM REDUCTION; REAL-WORLD PROBLEM; REDUCTION TECHNIQUES; RELAXED CONSISTENCY; SHORTEST PATH PROBLEM; TRANSPORTATION PLANNING;

GRAPH THEORY;

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

References (30)

1. Y. Aneja, V. Aggarwal, K. Nair. Shortest chain subject to side conditions. Networks, 13:295-302, 1983.
2. K. R. Apt. The Rough Guide to Constraint Propagation. Principles and Practice of Constraint Programming (CP), Springer LNCS 1713:1-23, 1999.
3. J. Beasley, N. Christofides. An Algorithm for the Resource Constrained Shortest Path Problem. Networks, 19:379-394, 1989.
4. R. Borndoerfer, A. Loebel. Scheduling duties by adaptive column generation. Technical Report, Konrad-Zuse-Zentrum fuer Informationstechink Berlin ZIB-01-02, 2001.
5. T.H. Cormen, C.E. Leiserson, R.L. Rivest. Introduction to Algorithms. The MIT Press, 1993.
6. I. Dumitrescu, N. Boland. The weight-constrained shortest path problem: preprocessing, scaling and dynamic programming algorithms with numerical comparisons. International Symposium on Mathematical Programming (ISMP), 2000.
7. T. Fahle, U. Junker, S.E. Karisch, N. Kohl, M. Sellmann, B. Vaaben. Constraint programming based column generation for crew assignment. Journal of Heuristics, 8(1):59-81, 2002.
8. T. Fahle, M. Sellmann. Cost-Based Filtering for the Constrained Knapsack Problem. Annals of Operations Research, 115:73-93, 2002.
9. S. Fortune, J. Hopcroft, J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10(2):111-121, 1980.
10. F. Focacci, A. Lodi, M. Milano. Cost-Based Domain Filtering. Principles and Practice of Constraint Programming (CP) Springer LNCS 1713:189-203, 1999.
11. F. Focacci, A. Lodi, M. Milano. Cutting Planes in Constraint Programming: An Hybrid Approach. CP-AI-OR'00, Paderborn Center for Parallel Computing, Technical Report tr001-2000:45-51, 2000.
12. M. L. Fredmann, R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34:596-615, 1987.
13. M. R. Garey, D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
14. G. Handler, I. Zang. A Dual Algorithm for the Restricted Shortest Path Problem. Networks, 10:293-310, 1980.
15. O. Jahn, R. Moehring, A. Schulz. Optimal routing of traffic flows with length restrictions in networks with congestion. Technical Report, TU Berlin 658-1999, 1999.
16. H. Joksch. The Shortest Route Problem with Constraints. Journal of Mathematical Analysis and Application, 14:191-197, 1966.
17. U. Junker, S.E. Karisch, N. Kohl, B. Vaaben, T. Fahle, M. Sellmann. A Framework for Constraint programming based column generation. Principles and Practice of Constraint Programming (CP), Springer LNCS 1713:261-274, 1999.
18. V. Kumar. Algorithms for Constraints Satisfaction problems: A Survey. The AI Magazine, by the AAAI, 13:32-44, 1992.
19. M. Luebbecke, U. Zimmermann. Computer aided scheduling of switching engines. CASPT, 2000.
20. K. Mehlhorn, M. Ziegelmann. Resource Constrained Shortest Paths. Proc. 8th European Symposium on Algorithms (ESA), Springer LNCS 1879:326-337, 2000.
21. A. Orda. Routing with end to end QoS guarantees in broadband networks. Conference on Computer Communications (Infocom), IEEE, 27-34, 1998.
22. G. Ottosson, E.S. Thorsteinsson. Linear Relaxation and Reduced-Cost Based Propagation of Continuous Variable Subscripts. CP-AI-OR'00, Paderbom Center for Parallel Computing, Technical Report tr-001-2000:129-138, 2000.
23. S. Pettie, V. Ramachandran. Computing undirected shortest paths using comparisons and additions. ACM-SIAM Symposium on Discrete Algorithms, January 2002.
24. J.C. Régin. Arc Consistency for Global Cardinality Constraints with Costs. Principles and Practice of Constraint Programming (CP), Springer LNCS 1713:390-404, 1999.
25. M. Sellmann. An Arc-Consistency Algorithm for the Weighted All Different Constraint. Principles and Practice of Constraint Programming (CP), Springer LNCS 2470:744-749, 2002.
26. M. Sellmann. Reduction Techniques in Constraint Programming and Combinatorial Optimization. PhD Thesis, University of Paderborn, Germany, http://www.upb.de/cs/sello/diss.ps, 2002.
27. M. Sellmann and T.Fahle. Coupling Variable Fixing Algorithms for the Automatic Recording Problem. Annual European Symposium on Algorithms (ESA), Springer LNCS 2161:134-145, 2001.
28. M. Thorup. Undirected single source shortest paths in linear time. Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 12-21, 1997.
29. G. Xue. Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees. International Performance, Computing, and Communications Conference (IPCCC), IEEE, 271-277, 2000.
30. T. H. Yunes, A. V. Moura, C. C. Souza. A hybrid approach for solving large crew scheduling problems. International Workshop on Practical Aspects of Declarative Languages (PADL), Springer LNCS 1753:293-307, 2000.