A polyhedral approach to multicommodity survivable network design
暂无分享,去创建一个
[1] K. Onaga,et al. On feasibility conditions of multicommodity flows in networks , 1971 .
[2] D. Avis. On the Extreme Rays of the Metric Cone , 1980, Canadian Journal of Mathematics.
[3] M. Minoux. Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements* , 1981 .
[4] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..
[5] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[6] Moshe Dror,et al. Fiberoptic circuit network design under reliability constraints , 1989, IEEE J. Sel. Areas Commun..
[7] Stephen C. Graves,et al. A composite algorithm for a concave-cost network flow problem , 1989, Networks.
[8] Laurence A. Wolsey,et al. Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints , 1990, Discret. Appl. Math..
[9] David Connolly. Knapsack Problems: Algorithms and Computer Implementations , 1991 .
[10] Mechthild Stoer,et al. Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints , 1992, SIAM J. Optim..
[11] Martin Grötschel,et al. Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints , 1992, Oper. Res..
[12] Geir Dahl,et al. The design of survivable directed networks , 1993, Telecommun. Syst..