[1] |
Assad, A. A.: Models for rail transportation. Transportation research A: policy and practice 14, 205-220 (1980) |

[2] |
Balakrishnan, A.; Magnanti, T. L.; Mirchandani, P.: Network design. Annotated bibliographies in combinatorial optimization, 311-334 (1997) · Zbl 1068.90503 |

[3] |
Balakrishnan, A.; Magnanti, T. L.; Wong, R. T.: A dual-ascent procedure for large-scale uncapacitated network design. Operations research 37, No. 5, 716-740 (1989) · Zbl 0681.90083 |

[4] |
C. Barnhart, H. Jin, P.H. Vance, Railroad blocking: a network design application, Operations Research, 1997 (forthcoming) |

[5] |
Barnhart, C.; Schneur, R. R.: Network design for express freight service. Operations research 44, No. 6, 852-863 (1996) · Zbl 0879.90077 |

[6] |
D. Berger, B. Gendron, J.-Y. Potvin, S. Raghavan, P. Soriano, Tabu search for a network loading problem with multiple facilities, Publication CRT-98-20, Centre de recherche sur les transports, Université de Montréal, 1998 |

[7] |
Braklow, J. W.; Graham, W. W.; Hassler, S. M.; Peck, K. E.; Powell, W. B.: Interactive optimization improves service and performance for yellow freight system. Interfaces 22, No. 1, 147-172 (1992) |

[8] |
Cordeau, J. -F.; Toth, P.; Vigo, D.: A survey of optimization models for train routing and scheduling. Transportation science 32, No. 4, 380-404 (1998) · Zbl 0987.90507 |

[9] |
Crainic, T. G.: A comparison of two methods for tactical planning in rail freight transportation. Operational research’84, 707-720 (1984) |

[10] |
Crainic, T. G.: Rail tactical planning: issues, models and tools. Freight transport planning and logistics, 463-509 (1988) |

[11] |
T.G. Crainic, Long haul freight transportation, in: R.W. Hall (Ed.), Handbook of Transportation Science, Kluwer, Norwell, MA, 1999 (forthcoming) |

[12] |
Crainic, T. G.; Ferland, J. -A.; Rousseau, J. -M.: A tactical planning model for rail freight transportation. Transportation science 18, No. 2, 165-184 (1984) |

[13] |
T.G. Crainic, A. Frangioni, B. Gendron, Bundle-based relaxation methods for multicommodity capacitated network design, Discrete Applied Mathematics (forthcoming) · Zbl 1026.90010 |

[14] |
T.G. Crainic, M. Gendreau, Cooperative parallel tabu search for capacitated network design, Publication CRT-98-71, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada, 1998 |

[15] |
T.G. Crainic, M. Gendreau, J.M. Farvolden, A simplex-based tabu search method for capacitated network design, INFORMS Journal on Computing, 1999 (forthcoming) · Zbl 1040.90506 |

[16] |
Crainic, T. G.; Laporte, G.: Planning models for freight transportation. European journal of operational research, 409-438 (1997) · Zbl 0919.90055 |

[17] |
T.G. Crainic, M.-C. Nicolle, Planification tactique du transport ferroviaire des marchandises: quelques aspects de modélisation, in: Actes du Premier Congrès International en France de Génie Industriel, CEFI-AFCET-GGI, Paris, 1986, pp. 161--174 |

[18] |
J.T.G. Crainic, J.-M. Rousseau, Multicommodity, multimode freight transportation: A general modeling and algorithmic framework, Transportation Research B: Methodological 20 (1986) 225--242 |

[19] |
Crainic, T. G.; Roy, J.: O.R. tools for tactical freight transportation planning. European journal of operational research 33, No. 3, 290-297 (1988) |

[20] |
Dejax, P. J.; Crainic, T. G.: A review of empty flows and fleet management models in freight transportation. Transportation science 21, No. 4, 227-247 (1987) |

[21] |
Delorme, L.; Roy, J.; Rousseau, J. -M.: Motor-carrier operation planning models: a state of the art. Freight transport planning and logistics, 510-545 (1988) |

[22] |
Farvolden, J. M.; Powell, W. B.: Subgradient methods for the service network design problem. Transportation science 28, No. 3, 256-272 (1994) · Zbl 0814.90023 |

[23] |
Farvolden, J. M.; Powell, W. B.; Lustig, I. J.: A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem. Operations research 41, No. 4, 669-694 (1992) · Zbl 0782.90032 |

[24] |
Gendron, B.; Crainic, T. G.: Parallel branch-and-bound algorithms: survey and synthesis. Operations research 42, No. 6, 1042-1066 (1994) · Zbl 0824.90096 |

[25] |
B. Gendron, T.G. Crainic, Parallel Implementations of bounding procedures for multicommodity capacitated network design problems, Publication CRT-94-45, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada, 1994 |

[26] |
B. Gendron, T.G. Crainic, Relaxations for multicommodity network design problems, Publication CRT-965, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada, 1994 |

[27] |
B. Gendron, T.G. Crainic, Bounding procedures for multicommodity capacitated network design problems, Publication CRT-96-06, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada, 1996 |

[28] |
Gendron, B.; Crainic, T. G.; Frangioni, A.: Multicommodity capacitated network design. Telecommunications network planning, 1-19 (1998) |

[29] |
Glover, F.; Laguna, M.: Tabu search. (1997) · Zbl 0930.90083 |

[30] |
Goldberg, D. E.: Genetic algorithms in search, optimization and machine learning. (1989) · Zbl 0721.68056 |

[31] |
Gorman, M. F.: An application of genetic and tabu searches to the freight railroad operating plan problem. Annals of operations research 78, 51-69 (1998) · Zbl 0896.90137 |

[32] |
Gorman, M. F.: Santa Fe railway uses an operating-plan model to improve its service design. Interfaces 28, No. 4, 1-12 (1998) |

[33] |
T. Grünert, H.-J. Sebastian, Planning models for long-haul operations of postal and express shipment companies, European Journal of Operational Research 122 (2000) this issue · Zbl 0961.90007 |

[34] |
Haghani, A. E.: Formulation and solution of combined train routing and makeup, and empty car distribution model. Transportation research B: methodological 23, No. 6, 431-433 (1989) |

[35] |
Holmberg, K.; Hellstrand, J.: Solving the uncapacitated network design problem by a Lagrangian heuristic and branch-and-bound. Operations research 46, No. 2, 247-259 (1998) · Zbl 0979.90060 |

[36] |
K. Holmberg, D. Yuan, A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem, Report LiTH-MAT-R-1996-23, Department of Mathematics, Linköping Institute of Technology, 1996 · Zbl 1106.90381 |

[37] |
Keaton, M. H.: Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches. Transportation research B: methodological 23 B, No. 6, 415-431 (1989) |

[38] |
Keaton, M. H.: Designing optimal railroad operating plans: a dual adjustment method for implementing Lagrangian relaxation. Transportation science 26, 263-279 (1992) · Zbl 0775.90299 |

[39] |
D. Kim, C. Barnhart, Transportation service network design: Models and algorithms, Report, Center for Transportation Studies, Massachusetts Institute of Technology, Cambridge, MA, 1997 |

[40] |
D. Kim, C. Barnhart, K. Ware, Multimodal Express package delivery: a service network design application, Transportation Science, 1997 (forthcoming) · Zbl 0958.90004 |

[41] |
Laarhoven, P.; Aarts, E. H. L.: Simulated annealing: theory and applications. (1987) · Zbl 0643.65028 |

[42] |
Lamar, B. W.; Sheffi, Y.; Powell, W. B.: A capacity improvement lower bound for fixed charge network design problems. Operations research 38, No. 4, 704-710 (1990) · Zbl 0728.90034 |

[43] |
Magnanti, T. L.; Mirchandani, P.; Vachani, R.: The convex hull of two core capacitated network design problems. Mathematical programming 60, 233-250 (1993) · Zbl 0788.90071 |

[44] |
Magnanti, T. L.; Mirchandani, P.; Vachani, R.: Modeling and solving the two-facility capacitated network loading problem. Operations research 43, 142-157 (1995) · Zbl 0830.90051 |

[45] |
T.L. Magnanti, L.A. Wolsey, Optimal trees, in: M. Ball, M.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Network Models, vol. 7, Handbooks in Operations Research and Management Science, North-Holland, Amsterdam, 1995, pp. 503--615 · Zbl 0839.90135 |

[46] |
Magnanti, T. L.; Wong, R. T.: Network design and transportation planning: models and algorithms. Transportation science 18, No. 1, 1-55 (1986) |

[47] |
Minoux, M.: Network synthesis and optimum network design problems: models solution methods and applications. Networks 19, 313-360 (1986) · Zbl 0666.90032 |

[48] |
Nemhauser, G. L.; Wolsey, L. A.: Integer and combinatorial optimization. (1988) · Zbl 0652.90067 |

[49] |
Newton, H. N.; Barnhart, C.; Vance, P. H.: Constructing railroad blocking plans to minimize handling costs. Transportation science 32, No. 4, 330-345 (1998) · Zbl 0987.90510 |

[50] |
Powell, W. B.: A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transportation science 20, No. 4, 246-357 (1986) |

[51] |
Powell, W. B.; Koskosidis, Y. A.: Shipment routing algorithms with tree constraints. Transportation science 26, No. 3, 230-245 (1992) · Zbl 0768.90019 |

[52] |
Powell, W. B.; Sheffi, Y.: The load-planning problem of motor carriers: problem description and a proposed solution approach. Transportation research A: policy and practice 17, No. 6, 471-480 (1983) |

[53] |
Powell, W. B.; Sheffi, Y.: Design and implementation of an interactive optimization system for the network design in the motor carrier industry. Operations research 37, No. 1, 12-29 (1989) |

[54] |
Roy, J.; Crainic, T. G.: Improving intercity freight routing with a tactical planning model. Interfaces 22, No. 3, 31-44 (1992) |

[55] |
Roy, J.; Delorme, L.: NETPLAN: A network optimization model for tactical planning in the less-than-truckload motor-carrier industry. Infor 27, No. 1, 22-35 (1989) |

[56] |
Salkin, H. M.; Mathur, K.: Foundations of integer programming. (1989) · Zbl 0683.90042 |