The fixed-charge shortest-path problem

INFORMS Journal on Computing

Volumn 24, Issue 4, 2012, Pages 578-596

  Engineer, Faramroze G ^a   Nemhauser, George L ^b   Savelsbergh, Martin W P ^c   Song, Jin Hwa ^d  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b Georgia Institute of Technology   (United States)

^c CSIRO   (Australia)

^d EXXONMOBIL UPSTREAM RESEARCH COMPANY   (United States)

Author keywords

Dynamic programming; Fixed charge; Shortest path

Indexed keywords

COMPUTATIONAL EXPERIMENT; DOMINANCE TECHNIQUE; DYNAMIC PROGRAMMING ALGORITHM; FIXED CHARGES; FIXED COST; KNAPSACK PROBLEMS; OPTIMAL SOLUTIONS; ORDERS OF MAGNITUDE; RESOURCE CONSUMPTION; RESOURCE-CONSTRAINED; SHORTEST PATH; SHORTEST PATH PROBLEM; SINK NODES; SOURCE NODES;

COST ACCOUNTING; DYNAMIC PROGRAMMING;

ALGORITHMS;

EID: 84873197026     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1110.0469     Document Type: Article

References (23)

1. Campbell, A., L. Clarke, A. Kleywegt, M. Savelsbergh. 1998. The inventory routing problem. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer Academic Publishers, Norwell, MA, 95-113.
2. Chen, Z.-L., W. B. Powell. 1999. Solving parallel machine scheduling problems by column generation. INFORMS J. Comput. 11(1) 78-94.
3. Cheng, T. C. E., M. Y. Kovalyov, N. V. Shakhlevich. 2006. Scheduling with controllable release dates and processing times: Makespan minimization. Eur. J. Oper. Res. 175(2) 751-768. (Pubitemid 44345087)
4. Christiansen, M. 1999. Decomposition of a combined inventory and time constrained ship routing problem. Transportation Sci. 33(1) 3-16. (Pubitemid 129723020)
5. Christiansen, M., B. Nygreen. 1998. Modelling path flows for a combined ship routing and inventory management problem. Ann. Oper. Res. 82 391-413.
6. Cordeau, J.-F., G. Laporte, J.-Y. Potvin, M. W. P. Savelsbergh. 2006a. Transportation on demand. C. Barnhart, G. Laporte, eds. Transportation: Handbooks in Operations Research and Management Science, Vol. 14. Elsevier, Amsterdam, 429-465.
7. Cordeau, J.-F., G. Laporte, M. W. P. Savelsbergh, D. Vigo. 2006b. Vehicle routing. C. Barnhart, G. Laporte, eds. Transportation: Handbooks in Operations Research and Management Science, Vol. 14. Elsevier, Amsterdam, 367-427.
8. Daniels, R. L., R. K. Sarin. 1989. Single machine scheduling with controllable processing times and number of jobs tardy. Oper. Res. 37(6) 981-984.
9. Desaulniers, G. 2010. Branch-and-price-and-cut for the splitdelivery vehicle routing problem with time windows. Oper. Res. 58(1) 179-192.
10. Desrosiers, J., Y. Dumas, M. M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. M. O. Ball, T. L. Magnanti, G. L. Nemhauser, eds. Network Routing: Handbooks in Operations Research and Management Science, Vol. 8. Elsevier, Amsterdam, 35-139.
11. Dror, M., G. Laporte, P. Trudeau. 1994. Vehicle routing with split deliveries. Discrete Appl. Math. 50(3) 239-254.
12. Dudzinski, K., S. Walukiewicz. 1987. Exact methods for the knapsack problem and its generalizations. Eur. J. Oper. Res. 28(1) 3-21. (Pubitemid 17499473)
13. Faaland, B. H. 1981. The multiperiod knapsack problem. Oper. Res. 29(3) 612-616.
14. Federgruen, A., P. Zipkin. 1984. A combined vehicle routing and inventory allocation problem. Oper. Res. 32(5) 109-1037.
15. Gendreau, M., P. Dejax, D. Feillet, C. Gueguen. 2006. Vehicle routing with time windows and split deliveries. Technical Report 2006-851, Laboratoire Informatique d'Avignon, Arignon, France.
16. Irnich, S., G. Desaulniers. 2005. Shortest path problems with resource constraints. G. Desaulniers, J. Desrosiers, M. M. Solomon, eds. Column Generation, Kluwer Academic Publishers, 33-66.
17. Irnich, S., D. Villeneuve. 2006. The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3. INFORMS J. Comput. 18(3) 391-406. (Pubitemid 44376263)
18. Nowicki, E., S. Zdrzałka. 1990. A survey of results for sequencing problems with controllable processing times. Discrete Optim. 26(2-3) 271-287.
19. Savelsbergh, M. W. P. 1997. A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6) 831-841.
20. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2) 254-265.
21. Valério de Carvalho, J. M. 1999. Exact solution of bin-packing problems using column generation and branch-and-bound. Ann. Oper. Res. 86 629-659.
22. Vance, P. H., C. Barnhart, E. L. Johnson, G. L. Nemhauser. 1994. Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Appl. 3(2) 111-130.
23. van den Akker, J. M., J. A. Hoogeveen, S. L. van de Velde. 1999. Parallel machine scheduling by column generation. Oper. Res. 47(6) 862-872. (Pubitemid 30594275)