A robustness approach to uncapacitated network design problems

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[3]  J. Rosenhead,et al.  Robustness in Sequential Investment Decisions , 1968 .

[4]  J. Rosenhead,et al.  Robustness and Optimality as Criteria for Strategic Decisions , 1972 .

[5]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[6]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[7]  Robert Richardson.  An Optimization Approach to Routing Aircraft , 1976 .

[8]  Michael Florian,et al.  The engine scheduling problem in a railway network , 1976 .

[9]  Hoang Hai Hoc,et al.  Topological optimization of networks: A nonlinear mixed integer model employing generalized benders , 1980 .

[10]  Thomas L. Magnanti,et al.  Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..

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

[12]  Thomas L. Magnanti,et al.  Tailoring Benders decomposition for uncapacitated network design , 1986 .

[13]  Leen Stougie.  Design and analysis of algorithms for stochastic integer programming , 1987 .

[14]  Hau L. Lee,et al.  A ROBUSTNESS APPROACH TO FACILITIES DESIGN , 1987 .

[15]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[16]  Genaro J. Gutierrez,et al.  Algorithms for robust single and multiple period layout planning for manufacturing systems , 1992 .