Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches

[1]  S. Martello,et al.  A New Algorithm for the 0-1 Knapsack Problem , 1988 .

[2]  Carlos F. Daganzo,et al.  Dynamic blocking for railyards: Part I. Homogeneous traffic , 1987 .

[3]  Dorit S. Hochbaum,et al.  OR Practice - Lagrangian Relaxation for Testing Infeasibility in VLSI Routing , 1986, Oper. Res..

[4]  Carlos F. Daganzo,et al.  Static Blocking at Railyards: Sorting Implications and Track Requirements , 1986, Transp. Sci..

[5]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[6]  Mark Hiazlip Keaton.  Optimizing railroad operations , 1985 .

[7]  Jean-Marc Rousseau,et al.  A Tactical Planning Model for Rail Freight Transportation , 1984, Transp. Sci..

[8]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[9]  Randolph W. Hall,et al.  Railroad classification yard throughput: The case of multistage triangular sorting☆ , 1983 .

[10]  Carl D. Martland,et al.  PMAKE Analysis: Predicting Rail Yard Time Distributions Using Probabilistic Train Connection Standards , 1982 .

[11]  Mark S. Daskin,et al.  Queuing Models of Classification and Connection Delay in Railyards , 1982 .

[12]  U. Pape,et al.  Algorithm 562: Shortest Path Lengths [H] , 1980, TOMS.

[13]  Lawrence Bodin,et al.  A model for the blocking of trains , 1980 .

[14]  E. R. Petersen.  Railyard Modeling: Part I. Prediction of Put-Through Time , 1977 .

[15]  E. R. Petersen.  Railyard Modeling: Part II. The Effect of Yard Facilities on Congestion , 1977 .

[16]  E. R. Petersen,et al.  THE RAILCAR NETWORK MODEL , 1975 .