Shorter path constraints for the resource constrained shortest path problem

Lecture Notes in Computer Science

Volumn 3524, Issue , 2005, Pages 201-216

  Gellermann, Thorsten ^a   Sellmann, Meinolf ^b   Wright, Robert ^c  

^a UNIVERSITY OF PADERBORN   (Germany)

^b Brown Univerity   (United States)

^c AIR FORCE RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COSTS; EDGE DETECTION; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

COST-BASED FILTERING ALGORITHMS; CP-BASED LAGRANGIAN RELAXATION; FILTERING ALGORITHMS; PATH-SUBSTRUCTURES;

LINEAR PROGRAMMING;

EID: 26444447488     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11493853_16     Document Type: Conference Paper

References (20)

1. Y. Aneja, V. Aggarwal, K. Nair. Shortest chain subject to side conditions. Networks, 13:295-302, 1983.
2. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. On the solution of Traveling Salesman Problems. Doc. Math. J. DMV, Extra Volume ICM III, pp.645-656, 1998.
3. F. Barahona and R. Anbil. The Volume Algorithm: producing primal solutions with a subgradient algorithm. Mathematical Programming, 87:385-399, 2000.
4. J. Beasley, N. Christofides. An Algorithm for the Resource Constrained Shortest Path Problem. Networks, 19:379-394, 1989.
5. H. Crowder. Computational improvements for subgradient optimization. Symposia Mathematica, XIX:357-372, 1976.
6. J. Desrosiers, Y. Dumas, M. Solomon, F. Soumis. Time Constrained Routing and Scheduling. Handbook in Operations Research and Management Science 8: Network Routing, North-Holland, 8:35-139, 1995.
7. 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.
8. 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.
9. F. Focacci, A. Lodi, M. Milano. Cost-Based Domain Filtering. Principles and Practice of Constraint Programming (CP) Springer LNCS 1713:189-203, 1999.
10. A. Frangioni. A Bundle type Dual-ascent Approach to Linear Multi-Commodity Min Cost Flow Problems. Technical Report, Dipartimento di Informatica, Universita di Pisa, TR-96-01, 1996.
11. A. Frangioni. Dual Ascent Methods and Multicommodity Flow Problems. Doctoral Thesis, Dipartimento di Informatica, Universita di Pisa, TD-97-05, 1997.
12. G. Handler, I. Zang. A Dual Algorithm for the Restricted Shortest Path Problem. Networks, 10:293-310, 1980.
13. J.E. Kelley. The Cutting Plane Method for Solving Convex Programs. Journal of the SIAM, 8:703-712, 1960.
14. A. Makri and D. Klabjan. A New Pricing Scheme for Airline Crew Scheduling. INFORMS Journal on Computing, 16:56-67, 2004.
15. K. Mehlhorn, M. Ziegelmann. Resource Constrained Shortest Paths. Proc. 8th European Symposium on Algorithms (ESA), Springer LNCS 1879:326-337, 2000.
16. M. Sellmann. Theoretical Foundations of CP-Based Lagrangian Relaxation. Principles and Practice of Constraint Programming (CP), Spirnger LNCS 3258:634-647, 2004.
17. M. Sellmann. Cost-Based Filtering for Shorter Path Constraints. Principles and Practice of Constraint Programming (CP), Springer LNCS 2833:679-693, 2003.
18. 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.
19. M. Sellmann and T. Fahle. Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. Annals of Operations Research, 118:17-33, 2003.
20. P. Toth and D. Vigo. The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, 2001.