Network design; Survivability; Hop constraints; Combinatorial Optimization
Abstract :
[en] Given an undirected graph, we study the problem of finding K edge-disjoint paths,
each one containing at most L edges, between a given pair of nodes. We focus on the case
of K = 2 and L = 3. For this particular case, previous known compact formulations are
valid only for the case with non-negative edge costs. We provide the first compact linear
description that is also valid for general edge costs. We describe new valid inequalities that
are added to a well known extended formulation in a layered graph, to get a full description
of the polyhedron for K = 2 and L = 3. We use a reduction of the problem to a size-2 stable
set problem to prove this second property.
Disciplines :
Quantitative methods in economics & management
Author, co-author :
Botton, Q.
Fortz, Bernard ; Université de Liège - ULiège > HEC Liège Research > HEC Liège Research: Business Analytics & Supply Chain Mgmt
scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.
Bibliography
Bendali F, Diarrassouba I, Mahjoub AR, Mailfert J (2010) The edge-disjoint 3-hop-constrained paths polytope. Discret Optim 7(4):222–233
Bley A (2003) On the complexity of vertex-disjoint length-restricted path problems. Comput Complex 12(3-4):131–149
Bley A, Neto J (2010) Approximability of 3- and 4-hop bounded disjoint paths problems. In: Eisenbrand F, Shepherd FB (eds) Integer programming and combinatorial optimization (IPCO), lecture notes in computer science, vol 6080. Springer, pp 205–218
Botton Q (2010) Survivable network design with quality of service constraints: extended formulations and Benders decomposition, Ph.D. Thesis, Facultés des Sciences Économiques, Sociales, Politiques et de Communication, Université Catholique de Louvain
Botton Q, Fortz B, Gouveia L, Poss M (2013) Benders decomposition for the hop-constrained survivable network design problem. INFORMS J Comput 25(1):13–26
Dahl G, Foldnes N, Gouveia L (2004) A note on hop-constrained walk polytopes. Oper Res Lett 32(4):345–349
Dahl G, Gouveia L (2004) On the directed hop-constrained shortest path problem. Oper Res Lett 32:15–22
Dahl G, Huygens D, Mahjoub AR, Pesneau P (2006) On the k edge-disjoint 2-hop-constrained paths polytope. Oper Res Lett 34(5):577–582
Gouveia L (1998) Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints. INFORMS J Comput 10:180–188
Huygens D, Mahjoub AR, Pesneau P (2004) Two edge-disjoint hop-constrained paths and polyhedra. SIAM J Discrete Math 18(2):287–312
Itaí A, Perl Y, Shiloach Y (1982) The complexity of finding maximum disjoint paths with length constraints. Networks 2:277–286
Janssen J, Kilakos K (1999) Bounded stable sets: polytopes and colorings. SIAM J Discrete Math 12(2):262–275
Wolsey LA (1998) Integer programming. Wiley, New York
This website uses cookies to improve user experience. Read more
Save & Close
Accept all
Decline all
Show detailsHide details
Cookie declaration
About cookies
Strictly necessary
Performance
Strictly necessary cookies allow core website functionality such as user login and account management. The website cannot be used properly without strictly necessary cookies.
This cookie is used by Cookie-Script.com service to remember visitor cookie consent preferences. It is necessary for Cookie-Script.com cookie banner to work properly.
Performance cookies are used to see how visitors use the website, eg. analytics cookies. Those cookies cannot be used to directly identify a certain visitor.
Used to store the attribution information, the referrer initially used to visit the website
Cookies are small text files that are placed on your computer by websites that you visit. Websites use cookies to help users navigate efficiently and perform certain functions. Cookies that are required for the website to operate properly are allowed to be set without your permission. All other cookies need to be approved before they can be set in the browser.
You can change your consent to cookie usage at any time on our Privacy Policy page.
