一种省际邮件转运网络设计的模型与算法

[1] Time constrained routing and scheduling. Desrosiers J,Dumas Y,Solomon M,et al. Handbooks in Operations Research and Management Science . 1995

[2] A lagrangean heuristic based branch-and-bound for the capacitated network design problem. Holmberg K,Yuan D. O R . 2000

[3] Exact and approximate algorithm of optimal network design. DioNume R,Florian M. Networks . 1979

[4] A dual-ascent procedure for large-scale uncapacitated network design. Balaktishnan A,Magnanti T. O R . 1989

[5] Solving the uncapacitated network design problem by lagrangean heuristic and branch-and-bound. Holmberg K,Hellstrand J. O R . 1998

[6] Optimal network problem: A branch-and-bound algorithm. Boyce D,Farbi A,Weischedel R. Enviro Plan . 1973

[7] Network flows: Theory, algorithm and application. Ahujia R,Magnanti T,Orlin J. . 1993

[1] Time constrained routing and scheduling. Desrosiers J,Dumas Y,Solomon M,et al. Handbooks in Operations Research and Management Science . 1995

[2] A lagrangean heuristic based branch-and-bound for the capacitated network design problem. Holmberg K,Yuan D. O R . 2000

[3] Exact and approximate algorithm of optimal network design. DioNume R,Florian M. Networks . 1979

[4] A dual-ascent procedure for large-scale uncapacitated network design. Balaktishnan A,Magnanti T. O R . 1989

[5] Solving the uncapacitated network design problem by lagrangean heuristic and branch-and-bound. Holmberg K,Hellstrand J. O R . 1998

[6] Optimal network problem: A branch-and-bound algorithm. Boyce D,Farbi A,Weischedel R. Enviro Plan . 1973

[7] Network flows: Theory, algorithm and application. Ahujia R,Magnanti T,Orlin J. . 1993