Network design and flow problems with cross-arc costs

European Journal of Operational Research

Volumn 189, Issue 3, 2008, Pages 890-901

  Cohn, Amy ^a   Davey, Melinda ^a   Schkade, Lisa ^a   Siegel, Amanda ^a   Wong, Caris ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Cross arc costs; Freight transportation; Network design; Network flow

Indexed keywords

COST FUNCTIONS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; PROBLEM SOLVING; VIRTUAL REALITY;

CROSS-ARC COSTS; NETWORK DESIGN; NETWORK FLOW; REAL-WORLD APPLICATIONS;

FREIGHT TRANSPORTATION;

EID: 40849135629     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.08.066     Document Type: Article

References (16)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows: Theory, Algorithms and Applications (1993), Prentice Hall, NJ, USA
2. Armacost A., Barnhart C., and Ware K. Composite variable formulations for express shipment service network design. Transportation Science 36 (2002) 1-20
3. Bertsimas D., and Tsitsiklis J. Introduction to Linear Optimization (1997), Athena Scientific
4. Budenbender K., Grunert T., and Sebastian H.-J. A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem. Transportation Science 34 (2000) 364-380
5. Croxton K., Gendron B., and Magnanti T. A comparison of mixed-integer programming models for non-convex piecewise linear cost minimization problems. Management Science 49 (2003) 1268-1273
6. Dembo R.S., Mulvey J.M., and Zenios S.A. Large-scale nonlinear network models and their application. Operations Research 37 (1989) 353-372
7. Goldberg A.V., Tardos E., and Tarjan R.E. Network flow algorithms. In: Korte B., Lovasz L., Proemel H.J., and Schrijver A. (Eds). Paths, Flows and VLSI-Design (1990), Springer-Verlag 101-164
8. Barnhart C., Hane C., and Vance P. Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research 48 (2000) 318-326
9. Holmberg K., and Hellstrand J. Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound. Operations Research 46 (1998) 247-259
10. Jones K.L., Lustig I.J., Farvolden J.M., and Powell W.B. Multicommodity network flows: The impact of formulation on decomposition. Mathematical Programming 62 (1993) 95-117
11. Kim D., Barnhart C., Ware K., and Reinhardt G. Multimodal express package delivery: A service network design application. Transportation Science 33 (1999) 391-407
12. LeBlanc L., and Boyce D. A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows. Transportation Research B 20B (1986) 259-265
13. Magnanti T.L., and Wong R.T. Network design and transportation planning: Models and algorithms. Transportation Science 18 (1984) 1-55
14. Minoux M. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks 19 (1989) 313-360
15. Pressmar D. Optimization of network topologies for service providers in the telecommunications market. International Transactions in Operational Research 8 (2001) 635-645
16. Schneur R., and Orlin J. A scaling algorithm for multicommodity flow problems. Operations Research 46 (1998) 231-246