메뉴 건너뛰기




Volumn 7, Issue 4, 2010, Pages 222-233

The k edge-disjoint 3-hop-constrained paths polytope

Author keywords

Edge disjoint paths; Facet; Flow; Hop constrained paths; Polytope; Survivable network

Indexed keywords

CONSTRAINED-PATH; CUTTING PLANE ALGORITHMS; EDGE-DISJOINT PATHS; FIXED INTEGERS; GRAPH G; HUYGENS; INTEGER PROGRAMMING FORMULATIONS; LINEAR RELAXATIONS; MINIMUM COST; POLYNOMIAL-TIME; POLYTOPES; SUBGRAPHS; SURVIVABLE NETWORKS;

EID: 77955511449     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2010.05.001     Document Type: Article
Times cited : (18)

References (34)
  • 4
    • 23244465489 scopus 로고    scopus 로고
    • Design of survivable networks: A survey
    • H. Kerivin, and A.R. Mahjoub Design of survivable networks: a survey Networks 46 2005 1 21
    • (2005) Networks , vol.46 , pp. 1-21
    • Kerivin, H.1    Mahjoub, A.R.2
  • 5
    • 0032680970 scopus 로고    scopus 로고
    • Notes on polyhedra associated with hop-constrained paths
    • G. Dahl Notes on polyhedra associated with hop-constrained paths Operations Research Letters 25 2 1999 97 100
    • (1999) Operations Research Letters , vol.25 , Issue.2 , pp. 97-100
    • Dahl, G.1
  • 6
    • 0142242243 scopus 로고    scopus 로고
    • On the directed hop-constrained shortest path problem
    • G. Dahl, and L. Gouveia On the directed hop-constrained shortest path problem Operations Research Letters 32 2004 15 22
    • (2004) Operations Research Letters , vol.32 , pp. 15-22
    • Dahl, G.1    Gouveia, L.2
  • 9
    • 34250661083 scopus 로고    scopus 로고
    • Integer programming formulation for the two 4-hop-constrained paths problem
    • D. Huygens, and A.R. Mahjoub Integer programming formulation for the two 4-hop-constrained paths problem Networks 49 2 2007 135 144
    • (2007) Networks , vol.49 , Issue.2 , pp. 135-144
    • Huygens, D.1    Mahjoub, A.R.2
  • 10
    • 2542615366 scopus 로고    scopus 로고
    • The 2-path network problem
    • G. Dahl, and B. Johannessen The 2-path network problem Networks 43 3 2004 190 199
    • (2004) Networks , vol.43 , Issue.3 , pp. 190-199
    • Dahl, G.1    Johannessen, B.2
  • 11
    • 33947579670 scopus 로고    scopus 로고
    • The two edge-connected hop-constrained network design problem: Valid inequalities and Branch-and-Cut
    • D. Huygens, M. Labb, A.R. Mahjoub, and P. Pesneau The two edge-connected hop-constrained network design problem: valid inequalities and Branch-and-Cut Networks 49 1 2007 116 133
    • (2007) Networks , vol.49 , Issue.1 , pp. 116-133
    • Huygens, D.1    Labb, M.2    Mahjoub, A.R.3    Pesneau, P.4
  • 14
    • 38649089178 scopus 로고    scopus 로고
    • Hop-constrained node survivable network design: An application to MPLS over WDM
    • L. Gouveia, P. Patricio, and A. de Sousa Hop-constrained node survivable network design: an application to MPLS over WDM Networks and Spatial Economics 8 1 2008 3 21
    • (2008) Networks and Spatial Economics , vol.8 , Issue.1 , pp. 3-21
    • Gouveia, L.1    Patricio, P.2    De Sousa, A.3
  • 15
    • 77955508738 scopus 로고    scopus 로고
    • Multicommodity flow models for spanning trees with hop constraints
    • L. Gouveia Multicommodity flow models for spanning trees with hop constraints Operations Research Letters 25 2 1999 97 100
    • (1999) Operations Research Letters , vol.25 , Issue.2 , pp. 97-100
    • Gouveia, L.1
  • 16
    • 0001276437 scopus 로고    scopus 로고
    • Using variable redefinition for computing lower bounds for minimum spanning
    • L. Gouveia Using variable redefinition for computing lower bounds for minimum spanning INFORMS Journal on Computing 10 2 1998 180 188
    • (1998) INFORMS Journal on Computing , vol.10 , Issue.2 , pp. 180-188
    • Gouveia, L.1
  • 17
    • 0035427762 scopus 로고    scopus 로고
    • A new Lagrangean relaxation approach for the hop-contrained minimum spanning tree problem
    • L. Gouveia, and C. Requejo A new Lagrangean relaxation approach for the hop-contrained minimum spanning tree problem European Journal of Operations Research 25 2 2001 539 552
    • (2001) European Journal of Operations Research , vol.25 , Issue.2 , pp. 539-552
    • Gouveia, L.1    Requejo, C.2
  • 18
    • 0032131211 scopus 로고    scopus 로고
    • The 2-hop spanning tree problem
    • G. Dahl The 2-hop spanning tree problem Operations Research Letters 23 12 1999 21 26
    • (1999) Operations Research Letters , vol.23 , Issue.12 , pp. 21-26
    • Dahl, G.1
  • 19
    • 0034313847 scopus 로고    scopus 로고
    • Solving the two-connected network with bounded meshes problem
    • B. Fortz, M. Labbe, and F. Maffioli Solving the two-connected network with bounded meshes problem Operations Research Letters 48 2000 866 877
    • (2000) Operations Research Letters , vol.48 , pp. 866-877
    • Fortz, B.1    Labbe, M.2    Maffioli, F.3
  • 20
    • 28244502056 scopus 로고    scopus 로고
    • Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
    • B. Fortz, A.R. Mahjoub, S.T. McCormick, and P. Pesneau Two-edge connected subgraphs with bounded rings: polyhedral results and Branch-and-Cut Mathematical Programming 105 1 2006 85 111
    • (2006) Mathematical Programming , vol.105 , Issue.1 , pp. 85-111
    • Fortz, B.1    Mahjoub, A.R.2    McCormick, S.T.3    Pesneau, P.4
  • 21
    • 0000007148 scopus 로고
    • Integer polyhedra arising from certain network design problems with connectivity constraints
    • M. Grtschel, and C.L. Monma Integer polyhedra arising from certain network design problems with connectivity constraints SIAM Journal on Discrete Mathematics 3 1990 502 523
    • (1990) SIAM Journal on Discrete Mathematics , vol.3 , pp. 502-523
    • Grtschel, M.1    Monma, C.L.2
  • 22
    • 0041881283 scopus 로고
    • Polyhedral approches to network survivability
    • M. Grtschel, C.L. Monma, and M. Stoer Polyhedral approches to network survivability F. Roberts, F. Hwang, C.L. Monma, Reliability of Computer and Communication Newtorks Series Discrete Mathematics and Computer Science vol. 5 1991 AMS/ACM 121 141
    • (1991) Series Discrete Mathematics and Computer Science , vol.5 , pp. 121-141
    • Grtschel, M.1    Monma, C.L.2    Stoer, M.3
  • 23
    • 0000312579 scopus 로고
    • Facets for polyhedra arising in the design of communications networks with low-connectivity constraints
    • M. Grtschel, C.L. Monma, and M. Stoer Facets for polyhedra arising in the design of communications networks with low-connectivity constraints SIAM Journal on Optimization 2 1992 474 504
    • (1992) SIAM Journal on Optimization , vol.2 , pp. 474-504
    • Grtschel, M.1    Monma, C.L.2    Stoer, M.3
  • 24
    • 0030212901 scopus 로고    scopus 로고
    • K-edge connected polyhedra on series-parallel graphs
    • M. Didi Biha, and A.R. Mahjoub k -edge connected polyhedra on series-parallel graphs Operations Research Letters 19 1996 71 78
    • (1996) Operations Research Letters , vol.19 , pp. 71-78
    • Didi Biha, M.1    Mahjoub, A.R.2
  • 26
    • 0042883409 scopus 로고
    • The k-edge connected spanning subgraph polyhedron
    • S. Chopra The k -edge connected spanning subgraph polyhedron SIAM Journal on Discrete Matematics 7 1994 245 259
    • (1994) SIAM Journal on Discrete Matematics , vol.7 , pp. 245-259
    • Chopra, S.1
  • 28
    • 29044442319 scopus 로고    scopus 로고
    • Critical extreme points of the 2-edge connected spanning subgraph polytope
    • J. Fonlupt, and A.R. Mahjoub Critical extreme points of the 2-edge connected spanning subgraph polytope Mathematical Programming 105 2006 289 310
    • (2006) Mathematical Programming , vol.105 , pp. 289-310
    • Fonlupt, J.1    Mahjoub, A.R.2
  • 29
    • 1342285560 scopus 로고    scopus 로고
    • The k-edge connected subgraph problem I: Polytopes and critical extreme points
    • M. Didi Biha, and A.R. Mahjoub The k -edge connected subgraph problem I: polytopes and critical extreme points Linear Algebra and its Applications 381 2004 117 139
    • (2004) Linear Algebra and Its Applications , vol.381 , pp. 117-139
    • Didi Biha, M.1    Mahjoub, A.R.2
  • 31
  • 32
    • 0002439168 scopus 로고
    • Zur allgemeinen kurventhorie
    • K. Menger Zur allgemeinen kurventhorie Fundamanta Mathematicae 10 1927 96 115
    • (1927) Fundamanta Mathematicae , vol.10 , pp. 96-115
    • Menger, K.1
  • 34
    • 0022129352 scopus 로고
    • The traveling salesman problem on a graph and some related integer polyhedra
    • G. Cornuejols, D. Naddef, and J. Fonlupt The traveling salesman problem on a graph and some related integer polyhedra Mathematical Programming 33 1985 1 27
    • (1985) Mathematical Programming , vol.33 , pp. 1-27
    • Cornuejols, G.1    Naddef, D.2    Fonlupt, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.