Survivable capacitated network design problem: new formulation and Lagrangean relaxation
暂无分享,去创建一个
[1] Geir Dahl,et al. A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems , 1998, INFORMS J. Comput..
[2] M. Stoer,et al. A polyhedral approach to multicommodity survivable network design , 1994 .
[3] J. MacGregor Smith,et al. Solving to optimality the uncapacitated fixed-charge network flow problem , 1998 .
[4] Martin Grötschel,et al. Survivable mobile phone network architectures: models and solution methods , 1998 .
[5] Geraldo Robson Mateus,et al. Solving to optimality the uncapacitated fixed-charge network flow problem , 1998, Comput. Oper. Res..
[6] H. Pirkul,et al. New formulation and relaxation to solve a concave-cost network flow problem , 1997 .
[7] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[8] Martin Grötschel,et al. Capacity and Survivability Models for Telecommunication Networks , 1997 .
[9] Moshe Dror,et al. Fiberoptic circuit network design under reliability constraints , 1989, IEEE J. Sel. Areas Commun..
[10] M. Minoux. Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements* , 1981 .