Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
暂无分享,去创建一个
[1] Walid Ben-Ameur,et al. Constrained length connectivity and survivable networks , 2000, Networks.
[2] Kemal Altinkemer,et al. Using a Hop-Constrained Model to Generate Alternative Communication Network Design , 2015, INFORMS J. Comput..
[3] Luís Gouveia,et al. A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem , 2001, Eur. J. Oper. Res..
[4] Larry J. LeBlanc,et al. Packet Routing in Telecommunication Networks with Path and Flow Restrictions , 1999, INFORMS J. Comput..
[5] Geir Dahl,et al. The 2-path network problem , 2004, Networks.
[6] Chung-Lun Li,et al. Finding disjoint paths with different path-costs: Complexity and algorithms , 1992, Networks.
[7] Jean Fonlupt,et al. Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope , 1999, IPCO.
[8] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[9] Martin Grötschel,et al. Polyhedral Approaches to Network Survivability , 1989, Reliability Of Computer And Communication Networks.
[10] Kamal Jain,et al. A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[11] W. R. Pulleyblank,et al. Polyhedral Combinatorics , 1989, ISMP.
[12] Geir Dahl,et al. The 2-hop spanning tree problem , 1998, Oper. Res. Lett..
[13] Andreas Bley,et al. On the complexity of vertex-disjoint length-restricted path problems , 2004, computational complexity.
[14] Sylvia C. Boyd,et al. An Integer Polytope Related to the Design of Survivable Communication Networks , 1993, SIAM J. Discret. Math..
[15] Geir Dahl,et al. Notes on polyhedra associated with hop-constrained paths , 1999, Oper. Res. Lett..
[16] L. Gouveia. Multicommodity flow models for spanning trees with hop constraints , 1996 .
[17] Ali Ridha Mahjoub,et al. Two-edge connected spanning subgraphs and polyhedra , 1994, Math. Program..
[18] W. B. Ameur. Constrained length connectivity and survivable networks , 2000 .
[19] Mechthild Stoer,et al. Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints , 1992, SIAM J. Optim..
[20] Ali Ridha Mahjoub,et al. On two-connected subgraph polytopes , 1995, Discret. Math..
[21] Mourad Baïou,et al. Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs , 1997, SIAM J. Discret. Math..
[22] Ali Ridha Mahjoub,et al. Steiner k-Edge Connected Subgraph Polyhedra , 2000, J. Comb. Optim..
[23] Luís Gouveia,et al. Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints , 1998, INFORMS J. Comput..
[24] M. Stoer. Design of Survivable Networks , 1993 .
[25] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[26] Alon Itai,et al. The complexity of finding maximum disjoint paths with length constraints , 1982, Networks.
[27] Martin Grötschel,et al. Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints , 1990, SIAM J. Discret. Math..
[28] Luís Gouveia,et al. Designing reliable tree networks with two cable technologies , 1998, Eur. J. Oper. Res..
[29] Walid Ben-Ameur,et al. Internet Routing and Related Topology Issues , 2003, SIAM J. Discret. Math..
[30] David P. Williamson,et al. An efficient approximation algorithm for the survivable network design problem , 1998, Math. Program..
[31] James B. Orlin,et al. A Faster Algorithm for Finding the Minimum Cut in a Directed Graph , 1994, J. Algorithms.
[32] Francesco Maffioli,et al. Solving the Two-Connected Network with Bounded Meshes Problem , 2000, Oper. Res..
[33] Hasan Pirkul,et al. New formulations and solution procedures for the hop constrained network design problem , 2003, Eur. J. Oper. Res..
[34] Collette R. Coullard,et al. THE K-WALK POLYHEDRON , 1994 .