A Dual-Based Algorithm for Multi-Level Network Design
暂无分享,去创建一个
[1] S. E. Dreyfus,et al. The steiner problem in graphs , 1971, Networks.
[2] M. Shamos. Problems in computational geometry , 1975 .
[3] Donald Erlenkotter,et al. A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] John E. Beasley. An algorithm for the steiner problem in graphs , 1984, Networks.
[6] Richard T. Wong,et al. A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..
[7] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[8] J. Current,et al. The hierarchical network design problem , 1986 .
[9] Anantaram Balakrishnan,et al. Problem reduction methods and a tree generation algorithm for the steiner network problem , 1987, Networks.
[10] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.
[11] J. Beasley. An algorithm for set covering problem , 1987 .
[12] J. E. Beasley. An SST-based algorithm for the steiner problem in graphs , 1989, Networks.
[13] A. Volgenant,et al. Reducing the hierarchical network design problem , 1989 .
[14] Thomas L. Magnanti,et al. A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..
[15] Billy E. Gillett,et al. A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks , 1991, INFORMS J. Comput..
[16] Cees Duin,et al. The multi-weighted Steiner tree problem , 1991, Ann. Oper. Res..
[17] Michel X. Goemans,et al. 2-Change for k-connected networks , 1991, Oper. Res. Lett..
[18] Thomas L. Magnanti,et al. The multi-level network design problem , 1991 .
[19] Kalyan T. Talluri. Issues in the design and analysis of survivable networks , 1991 .
[20] Hasan Pirkul,et al. The Hierarchical Network Design Problem: A New Formulation and Solution Procedures , 1991, Transp. Sci..
[21] Martin Grötschel,et al. Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints , 1992, Oper. Res..
[22] M. R. Rao,et al. Solving the Steiner Tree Problem on a Graph Using Branch and Cut , 1992, INFORMS J. Comput..
[23] T. Magnanti,et al. Modeling and heuristic worst-case performance analysis of the two-level network design problem , 1994 .