Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios

We consider the design of a multicommodity flow network, in which point-to-point demands are routed across the network subject to link capacity restrictions. Such a design must build enough capacity and diverse routing paths through the network to ensure that feasible multicommodity flows continue t...

Full description

Saved in:

Bibliographic Details
Published in	Omega (Oxford) Vol. 36; no. 6; pp. 1057 - 1071
Main Authors	Garg, Manish, Smith, J. Cole
Format	Journal Article
Language	English
Published	Exeter Elsevier Ltd 01.12.2008 Elsevier Elsevier Science Publishers Pergamon Press Inc
Series	Omega
Subjects	Algorithms Analysis Applied sciences Computing Design and construction Exact sciences and technology Flows in networks. Combinatorial problems Integer programming Integer programming Routing Optimization Computing Mathematical programming Operational research and scientific management Operational research. Management science Optimization Optimization algorithms Routing Studies Telecommunication systems United States Integer programming Routing Computing Optimization Script Channel capacity Network flow Partition method Optimal algorithm Rupture Mixed integer programming Failures Modeling Multicommodity flow problem Graph connectivity Inequality constraint
Online Access	Get full text
ISSN	0305-0483 1873-5274
DOI	10.1016/j.omega.2006.05.006

Cover

Abstract	We consider the design of a multicommodity flow network, in which point-to-point demands are routed across the network subject to link capacity restrictions. Such a design must build enough capacity and diverse routing paths through the network to ensure that feasible multicommodity flows continue to exist, even when components of the network fail. In this paper, we examine several methodologies to optimally design a minimum-cost survivable network that continues to support a multicommodity flow under any of a given set of failure scenarios, where each failure scenario consists of the simultaneous failure of multiple arcs. We begin by providing a single extensive form mixed-integer programming formulation for this problem, along with a Benders decomposition algorithm as an alternative to the extensive form approach. We next investigate strategies to improve the performance of the algorithm by augmenting the master problem with several valid inequalities such as cover constraints, connectivity constraints, and path constraints. For the smallest instances (eight nodes, 10 origin–destination pairs, and 10 failure scenarios), the Benders implementation consumes only 10% of the time required by the mixed-integer programming formulation, and our best augmentation strategy reduces the solution time by another 50%. For medium- and large-sized instances, the extensive form problem fails to terminate within 2 h on any instance, while our decomposition algorithms provide optimal solutions on all but two problem instances.
AbstractList	We consider the design of a multicommodity flow network, in which point-to-point demands are routed across the network subject to link capacity restrictions. Such a design must build enough capacity and diverse routing paths through the network to ensure that feasible multicommodity flows continue to exist, even when components of the network fail. In this paper, we examine several methodologies to optimally design a minimum-cost survivable network that continues to support a multicommodity flow under any of a given set of failure scenarios, where each failure scenario consists of the simultaneous failure of multiple arcs. We begin by providing a single extensive form mixed-integer programming formulation for this problem, along with a Benders decomposition algorithm as an alternative to the extensive form approach. We next investigate strategies to improve the performance of the algorithm by augmenting the master problem with several valid inequalities such as cover constraints, connectivity constraints, and path constraints. For the smallest instances (eight nodes, 10 origin–destination pairs, and 10 failure scenarios), the Benders implementation consumes only 10% of the time required by the mixed-integer programming formulation, and our best augmentation strategy reduces the solution time by another 50%. For medium- and large-sized instances, the extensive form problem fails to terminate within 2 h on any instance, while our decomposition algorithms provide optimal solutions on all but two problem instances. We consider the design of a multicommodity flow network, in which point-to-point demands are routed across the network subject to link capacity restrictions. Such a design must build enough capacity and diverse routing paths through the network to ensure that feasible multicommodity flows continue to exist, even when components of the network fail. In this paper, we examine several methodologies to optimally design a minimum-cost survivable network that continues to support a multicommodity flow under any of a given set of failure scenarios, where each failure scenario consists of the simultaneous failure of multiple arcs. We begin by providing a single extensive form mixed-integer programming formulation for this problem, along with a Benders decomposition algorithm as an alternative to the extensive form approach. We next investigate strategies to improve the performance of the algorithm by augmenting the master problem with several valid inequalities such as cover constraints, connectivity constraints, and path constraints. For the smallest instances (eight nodes, 10 origin-destination pairs, and 10 failure scenarios), the Benders implementation consumes only 10% of the time required by the mixed-integer programming formulation, and our best augmentation strategy reduces the solution time by another 50%. For medium- and large-sized instances, the extensive form problem fails to terminate within 2 h on any instance, while our decomposition algorithms provide optimal solutions on all but two problem instances. [PUBLICATION ABSTRACT] We consider the design of a multicommodity flow network, in which point-to-point demands are routed across the network subject to link capacity restrictions. Such a design must build enough capacity and diverse routing paths through the network to ensure that feasible multicommodity flows continue to exist, even when components of the network fail. In this paper, we examine several methodologies to optimally design a minimum-cost survivable network that continues to support a multicommodity flow under any of a given set of failure scenarios, where each failure scenario consists of the simultaneous failure of multiple arcs. We begin by providing a single extensive form mixed-integer programming formulation for this problem, along with a Benders decomposition algorithm as an alternative to the extensive form approach. We next investigate strategies to improve the performance of the algorithm by augmenting the master problem with several valid inequalities such as cover constraints, connectivity constraints, and path constraints. For the smallest instances (eight nodes, 10 origin--destination pairs, and 10 failure scenarios), the Benders implementation consumes only 10% of the time required by the mixed-integer programming formulation, and our best augmentation strategy reduces the solution time by another 50%. For medium- and large-sized instances, the extensive form problem fails to terminate within 2h on any instance, while our decomposition algorithms provide optimal solutions on all but two problem instances. We consider the design of a multicommodity flow network, in which point-to-point demands are routed across the network subject to link capacity restrictions. Such a design must build enough capacity and diverse routing paths through the network to ensure that feasible multicommodity flows continue to exist, even when components of the network fail. In this paper, we examine several methodologies to optimally design a minimum-cost survivable network that continues to support a multicommodity flow under any of a given set of failure scenarios, where each failure scenario consists of the simultaneous failure of multiple arcs. We begin by providing a single extensive form mixed-integer programming formulation for this problem, along with a Benders decomposition algorithm as an alternative to the extensive form approach. We next investigate strategies to improve the performance of the algorithm by augmenting the master problem with several valid inequalities such as cover constraints, connectivity constraints, and path constraints. For the smallest instances (eight nodes, 10 origin--destination pairs, and 10 failure scenarios), the Benders implementation consumes only 10% of the time required by the mixed-integer programming formulation, and our best augmentation strategy reduces the solution time by another 50%. For medium- and large-sized instances, the extensive form problem fails to terminate within 2h on any instance, while our decomposition algorithms provide optimal solutions on all but two problem instances. Keywords: Integer programming; Routing; Optimization; Computing We consider the design of a multicommodity flow network, in which point-to-point demands are routed across the network subject to link capacity restrictions. Such a design must build enough capacity and diverse routing paths through the network to ensure that feasible multicommodity flows continue to exist, even when components of the network fail. In this paper, we examine several methodologies to optimally design a minimum-cost survivable network that continues to support a multicommodity flow under any of a given set of failure scenarios, where each failure scenario consists of the simultaneous failure of multiple arcs. We begin by providing a single extensive form mixed-integer programming formulation for this problem, along with a Benders decomposition algorithm as an alternative to the extensive form approach. We next investigate strategies to improve the performance of the algorithm by augmenting the master problem with several valid inequalities such as cover constraints, connectivity constraints, and path constraints. For the smallest instances (eight nodes, 10 origin-destination pairs, and 10 failure scenarios), the Benders implementation consumes only 10% of the time required by the mixed-integer programming formulation, and our best augmentation strategy reduces the solution time by another 50%. For medium- and large-sized instances, the extensive form problem fails to terminate within 2Â h on any instance, while our decomposition algorithms provide optimal solutions on all but two problem instances.
Audience	Trade Academic
Author	Garg, Manish Smith, J. Cole
Author_xml	– sequence: 1 givenname: Manish surname: Garg fullname: Garg, Manish – sequence: 2 givenname: J. Cole surname: Smith fullname: Smith, J. Cole email: cole@ise.ufl.edu
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20257855$$DView record in Pascal Francis http://econpapers.repec.org/article/eeejomega/v_3a36_3ay_3a2008_3ai_3a6_3ap_3a1057-1071.htm$$DView record in RePEc
BookMark	eNqFUk2P2yAQtaqt1Oy2v6AXVKlHu4OJjX3oYbXql5Sql_aMWBgSUgwpkET59yV1tIfVais0PGl4b4b5uK6ufPBYVW8pNBRo_2HbhAnXsmkB-ga6psCLakEHzuqu5curagEMuhqWA3tVXae0BQA6AFtU_nvQ6BKRXhPp1iHavJkSMSGSvEGiMdm1J8GQtI8He5D3Dsm0d9mqME1B23wixoUj8ZiPIf5O5FgCkDV6jNIRI63bRyRJoZfRhvS6emmkS_jmgjfVr8-fft59rVc_vny7u13VqmM817KXYHpO73uUoLEdjaLYF9RGIwJbdrjkFLmSmpenTlHoGYwAKNXIqGQ31bs57i6GP3tMWWzDPvqSUrSsZ-M4cF5I9UxaS4fCehNylOry99JgY4v7lvKBUza2XeE3T_DL0TiVfjwlWM2CiDtUYhftJONJIOL237zEQTDJ-nKdipXhDQVssbNrV4xCxwUFTsUmTyXc-0tRMinpTJRe2fQQtoW240N3TstmnoohpYjmgUJBnPdFbMWc_7wvAjpRoKjGRypls8w2-FKldf_Rfpy1ZZXwYDGKpCx6hdpGVFnoYJ_V_wUoHN-2
CODEN	OMEGA6
CitedBy_id	crossref_primary_10_1016_j_oceaneng_2023_115525 crossref_primary_10_2139_ssrn_4051814 crossref_primary_10_1016_j_cor_2014_03_015 crossref_primary_10_1080_0740817X_2010_546387 crossref_primary_10_1016_j_omega_2022_102659 crossref_primary_10_1007_s11067_018_9438_6 crossref_primary_10_1109_TCOMM_2015_2417567 crossref_primary_10_4236_am_2014_52026 crossref_primary_10_1007_s11067_016_9331_0 crossref_primary_10_7232_iems_2013_12_2_103 crossref_primary_10_1016_j_ress_2010_03_008 crossref_primary_10_1016_j_cie_2017_11_019 crossref_primary_10_3141_2548_09 crossref_primary_10_1016_j_omega_2011_03_003 crossref_primary_10_1080_0013791X_2012_677114 crossref_primary_10_1007_s41109_017_0058_8 crossref_primary_10_1016_j_ejor_2015_10_022 crossref_primary_10_1287_trsc_2019_0928 crossref_primary_10_1016_j_cor_2018_03_008 crossref_primary_10_1016_j_ejco_2020_100002 crossref_primary_10_54175_hsustain3010001 crossref_primary_10_1016_j_ejor_2011_09_044 crossref_primary_10_1061__ASCE_IS_1943_555X_0000212 crossref_primary_10_1007_s00291_011_0250_7 crossref_primary_10_1016_j_omega_2015_02_001 crossref_primary_10_1109_TTE_2020_3002875 crossref_primary_10_1016_j_ejor_2018_02_015 crossref_primary_10_1007_s11235_015_0067_9 crossref_primary_10_1007_s10586_014_0365_0 crossref_primary_10_1002_nav_21739 crossref_primary_10_1016_j_ress_2013_05_002 crossref_primary_10_1007_s40314_021_01453_2 crossref_primary_10_1007_s11269_016_1272_3 crossref_primary_10_1016_j_cor_2022_106120 crossref_primary_10_1287_ijoc_2023_0286 crossref_primary_10_1007_s10898_016_0422_8 crossref_primary_10_1016_j_endm_2013_05_115
Cites_doi	10.1287/opre.41.4.669 10.1287/inte.28.2.32 10.1287/opre.40.2.309 10.1007/BF01580440 10.1016/0895-7177(93)90236-R 10.1057/palgrave.jors.2600913 10.1287/mnsc.46.5.693.12042 10.1023/A:1010058513558 10.1287/opre.26.2.209 10.1007/s101070100284 10.1007/BF01582013 10.1002/1520-6750(199304)40:3<305::AID-NAV3220400303>3.0.CO;2-4 10.1137/0802024 10.1002/net.3230080107 10.1007/s002110050054 10.1080/07408170600729192 10.1016/0377-2217(85)90091-8 10.1287/opre.43.6.1012 10.1287/opre.48.2.318.12378 10.1137/0403043 10.1016/0166-218X(95)90600-K 10.1016/S0166-218X(02)00236-6 10.1287/opre.46.5.719 10.1287/opre.12.6.934 10.1002/net.20009 10.1287/trsc.27.2.102 10.1287/opre.46.2.184 10.1287/opre.46.1.116 10.1287/ijoc.10.1.1 10.1016/S0167-6377(00)00027-4
ContentType	Journal Article
Copyright	2006 Elsevier Ltd 2008 INIST-CNRS COPYRIGHT 2008 Elsevier Science Publishers Copyright Pergamon Press Inc. Dec 2008
Copyright_xml	– notice: 2006 Elsevier Ltd – notice: 2008 INIST-CNRS – notice: COPYRIGHT 2008 Elsevier Science Publishers – notice: Copyright Pergamon Press Inc. Dec 2008
DBID	AAYXX CITATION IQODW DKI X2L K9.
DOI	10.1016/j.omega.2006.05.006
DatabaseName	CrossRef Pascal-Francis RePEc IDEAS RePEc ProQuest Health & Medical Complete (Alumni)
DatabaseTitle	CrossRef ProQuest Health & Medical Complete (Alumni)
DatabaseTitleList	ProQuest Health & Medical Complete (Alumni)
Database_xml	– sequence: 1 dbid: DKI name: RePEc IDEAS url: http://ideas.repec.org/ sourceTypes: Index Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Business Applied Sciences
EISSN	1873-5274
EndPage	1071
ExternalDocumentID	1452320581 A178713925 eeejomega_v_3a36_3ay_3a2008_3ai_3a6_3ap_3a1057_1071_htm 20257855 10_1016_j_omega_2006_05_006 S0305048306000478
Genre	Feature
GeographicLocations	United States
GeographicLocations_xml	– name: United States
GroupedDBID	--K --M -~X .~1 0R~ 13V 1B1 1OL 1RT 1~. 1~5 29N 4.4 457 4G. 5VS 7-5 71M 8P~ 96U 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABJNI ABKBG ABMAC ABMVD ABUCO ABXDB ABYKQ ACBMB ACDAQ ACGFS ACHQT ACHRH ACNCT ACNTT ACRLP ADBBV ADEZE ADIYS ADMUD AEBSH AEKER AENEX AFACB AFAZI AFFNX AFKWA AFTJW AGHFR AGJBL AGQRV AGUBO AGUMN AGYEJ AHEHV AHHHB AHMBA AIEXJ AIKHN AITUG AJBFU AJOXV ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ASPBG AVWKF AXJTR AZFZN BAAKF BDEBP BKOJK BKOMP BLXMC BNSAS CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA HAMUX HVGLF HZ~ IAO IEA IGG IHE IHR IOF IPO ITC J1W KOM LPU LXL LY1 M41 MO0 MS~ N95 O-L O9- OAUVE OHT OZT P-8 P-9 PC. PQQKQ Q38 R2- RIG ROL RPZ SDF SDG SDP SDS SES SEW SPCBC SSB SSD SSL SSZ T5K TAE TAF TN5 U5U VQA WUQ XI7 XPP XSW XYO YNT ZRQ ~G- AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADMHG ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS IPC ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 08R 0R 1 8P AAPBV ABFLS ADALY DKI G- HZ IPNFZ K LOTEE LXI M MS NADUK PQEST QVA STF X X2L K9.
ID	FETCH-LOGICAL-c537t-a6a0f671b6ea0de29fc1e6e29dfdee0345e471e7cad7fc15c10630900eac931a3
IEDL.DBID	AIKHN
ISSN	0305-0483
IngestDate	Tue Oct 07 05:12:42 EDT 2025 Fri Jun 13 00:12:02 EDT 2025 Mon Oct 20 17:20:55 EDT 2025 Wed Aug 18 03:51:22 EDT 2021 Mon Jul 21 09:13:35 EDT 2025 Wed Oct 01 03:39:02 EDT 2025 Thu Apr 24 22:50:38 EDT 2025 Fri Feb 23 02:30:28 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	6
Keywords	Integer programming Routing Computing Optimization Script Channel capacity Network flow Partition method Optimal algorithm Rupture Mixed integer programming Failures Modeling Multicommodity flow problem Graph connectivity Inequality constraint
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c537t-a6a0f671b6ea0de29fc1e6e29dfdee0345e471e7cad7fc15c10630900eac931a3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14
PQID	236399877
PQPubID	46729
PageCount	15
ParticipantIDs	proquest_journals_236399877 gale_infotracgeneralonefile_A178713925 gale_infotracacademiconefile_A178713925 repec_primary_eeejomega_v_3a36_3ay_3a2008_3ai_3a6_3ap_3a1057_1071_htm pascalfrancis_primary_20257855 crossref_primary_10_1016_j_omega_2006_05_006 crossref_citationtrail_10_1016_j_omega_2006_05_006 elsevier_sciencedirect_doi_10_1016_j_omega_2006_05_006
ProviderPackageCode	CITATION AAYXX
PublicationCentury	2000
PublicationDate	2008-12-01
PublicationDateYYYYMMDD	2008-12-01
PublicationDate_xml	– month: 12 year: 2008 text: 2008-12-01 day: 01
PublicationDecade	2000
PublicationPlace	Exeter
PublicationPlace_xml	– name: Exeter – name: Oxford
PublicationSeriesTitle	Omega
PublicationTitle	Omega (Oxford)
PublicationYear	2008
Publisher	Elsevier Ltd Elsevier Elsevier Science Publishers Pergamon Press Inc
Publisher_xml	– name: Elsevier Ltd – name: Elsevier – name: Elsevier Science Publishers – name: Pergamon Press Inc
References	Stoer, Dahl (bib19) 1994; 68 Lim C, Smith JC. Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Transactions 2006, to appear. Grötschel, Monma (bib22) 1990; 3 Pochet, Wolsey (bib35) 1995; 59 Cormican, Morton, Wood (bib14) 1998; 46 Aki O. Capacitated facility location formulations to expedite disaster relief. Masters Thesis, Department of Systems and Industrial Engineering, The University of Arizona; 2004. Mamer, McBride (bib10) 2000; 46 Sutter, Vanderbeck, Wolsey (bib2) 1998; 46 Barnhart (bib7) 1993; 40 Luna, Mahey (bib27) 2000; 26 Smith, Schaefer, Yen (bib30) 2004; 44 Dahl, Stoer (bib21) 1998; 10 Marcotte (bib34) 1985; 33 Kennington (bib6) 1978; 26 McBride (bib12) 1998; 28 Grötschel, Monma, Stoer (bib26) 1992; 2 Wood (bib17) 1993; 17 Wollmer (bib16) 1964; 12 Iri (bib20) 1971; 13 Barnhart, Sheffi (bib8) 1993; 27 Atamtürk (bib32) 2002; 92 Kall, Wallace (bib29) 1994 Nemhauser, Wolsey (bib31) 1999 Assad (bib5) 1978; 8 McBride (bib13) 1985; 21 Balakrishnan, Magnanti, Mirchandani (bib24) 1998; 46 Balas (bib33) 1975; 8 Rios, Marianov, Gutierrez (bib28) 2000; 51 Grötschel, Monma, Stoer (bib23) 1995; 43 Soni, Gupta, Pirkul (bib4) 1999; 1 Wu (bib3) 1992 Farvolden, Powell, Lustig (bib11) 1993; 41 Grötschel, Monma, Stoer (bib25) 1992; 40 Goldschmidt, Laugier, Olinick (bib1) 2003; 129 Barnhart, Hane, Vance (bib9) 2000; 48 Wu (10.1016/j.omega.2006.05.006_bib3) 1992 McBride (10.1016/j.omega.2006.05.006_bib13) 1985; 21 Luna (10.1016/j.omega.2006.05.006_bib27) 2000; 26 Grötschel (10.1016/j.omega.2006.05.006_bib26) 1992; 2 Kall (10.1016/j.omega.2006.05.006_bib29) 1994 Iri (10.1016/j.omega.2006.05.006_bib20) 1971; 13 Grötschel (10.1016/j.omega.2006.05.006_bib22) 1990; 3 Grötschel (10.1016/j.omega.2006.05.006_bib23) 1995; 43 Farvolden (10.1016/j.omega.2006.05.006_bib11) 1993; 41 Nemhauser (10.1016/j.omega.2006.05.006_bib31) 1999 Marcotte (10.1016/j.omega.2006.05.006_bib34) 1985; 33 McBride (10.1016/j.omega.2006.05.006_bib12) 1998; 28 Atamtürk (10.1016/j.omega.2006.05.006_bib32) 2002; 92 Barnhart (10.1016/j.omega.2006.05.006_bib8) 1993; 27 Rios (10.1016/j.omega.2006.05.006_bib28) 2000; 51 Goldschmidt (10.1016/j.omega.2006.05.006_bib1) 2003; 129 Mamer (10.1016/j.omega.2006.05.006_bib10) 2000; 46 Pochet (10.1016/j.omega.2006.05.006_bib35) 1995; 59 Wood (10.1016/j.omega.2006.05.006_bib17) 1993; 17 Stoer (10.1016/j.omega.2006.05.006_bib19) 1994; 68 Barnhart (10.1016/j.omega.2006.05.006_bib7) 1993; 40 Cormican (10.1016/j.omega.2006.05.006_bib14) 1998; 46 Kennington (10.1016/j.omega.2006.05.006_bib6) 1978; 26 Dahl (10.1016/j.omega.2006.05.006_bib21) 1998; 10 Sutter (10.1016/j.omega.2006.05.006_bib2) 1998; 46 Soni (10.1016/j.omega.2006.05.006_bib4) 1999; 1 Balakrishnan (10.1016/j.omega.2006.05.006_bib24) 1998; 46 Assad (10.1016/j.omega.2006.05.006_bib5) 1978; 8 Wollmer (10.1016/j.omega.2006.05.006_bib16) 1964; 12 10.1016/j.omega.2006.05.006_bib15 Smith (10.1016/j.omega.2006.05.006_bib30) 2004; 44 Grötschel (10.1016/j.omega.2006.05.006_bib25) 1992; 40 Balas (10.1016/j.omega.2006.05.006_bib33) 1975; 8 10.1016/j.omega.2006.05.006_bib18 Barnhart (10.1016/j.omega.2006.05.006_bib9) 2000; 48
References_xml	– year: 1992 ident: bib3 article-title: Fiber network service survivability – volume: 48 start-page: 318 year: 2000 end-page: 326 ident: bib9 article-title: Using branch-and-price-and-cut to solve origin–destination integer multicommodity flow problems publication-title: Operations Research – volume: 92 start-page: 425 year: 2002 end-page: 437 ident: bib32 article-title: On capacitated network design cut-set polyhedra publication-title: Mathematical Programming Series B – volume: 1 start-page: 303 year: 1999 end-page: 315 ident: bib4 article-title: Survivable network design: the state of the art publication-title: Information Systems Frontiers – reference: Lim C, Smith JC. Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Transactions 2006, to appear. – year: 1999 ident: bib31 article-title: Integer and combinatorial optimization – volume: 59 start-page: 57 year: 1995 end-page: 74 ident: bib35 article-title: Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation publication-title: Discrete Applied Mathematics – volume: 26 start-page: 211 year: 2000 end-page: 216 ident: bib27 article-title: Bounds for global optimization of capacity expansion and flow assignment problems publication-title: Operations Research Letters – year: 1994 ident: bib29 article-title: Stochastic programming – volume: 46 start-page: 184 year: 1998 end-page: 196 ident: bib14 article-title: Stochastic network interdiction publication-title: Operations Research – volume: 13 start-page: 129 year: 1971 end-page: 135 ident: bib20 article-title: On an extension of the maximum-flow minimum-cut theorem to multicommodity flows publication-title: Journal of the Operations Research Society of Japan – volume: 46 start-page: 116 year: 1998 end-page: 136 ident: bib24 article-title: Designing hierarchical survivable networks publication-title: Operations Research – volume: 8 start-page: 146 year: 1975 end-page: 164 ident: bib33 article-title: Facets of the knapsack polytope publication-title: Mathematical Programming – volume: 21 start-page: 82 year: 1985 end-page: 92 ident: bib13 article-title: Solving embedded generalized network flow problems publication-title: European Journal of Operational Research – volume: 129 start-page: 99 year: 2003 end-page: 128 ident: bib1 article-title: SONET/SDH ring assignment with capacity constraints publication-title: Discrete Applied Mathematics – volume: 17 start-page: 1 year: 1993 end-page: 18 ident: bib17 article-title: Deterministic network interdiction publication-title: Mathematical and Computer Modelling – reference: Aki O. Capacitated facility location formulations to expedite disaster relief. Masters Thesis, Department of Systems and Industrial Engineering, The University of Arizona; 2004. – volume: 10 start-page: 1 year: 1998 end-page: 11 ident: bib21 article-title: A cutting plane algorithm for multicommodity survivable network design problems publication-title: INFORMS Journal on Computing – volume: 44 start-page: 12 year: 2004 end-page: 26 ident: bib30 article-title: A stochastic integer programming approach to solving a synchronous optical network ring design problem publication-title: Networks – volume: 26 start-page: 209 year: 1978 end-page: 236 ident: bib6 article-title: A survey of linear cost multicommodity network flows publication-title: Operations Research – volume: 46 start-page: 693 year: 2000 end-page: 709 ident: bib10 article-title: A decomposition-based pricing procedure for large-scale linear programs: an application to the linear multicommodity flow problem publication-title: Management Science – volume: 3 start-page: 502 year: 1990 end-page: 523 ident: bib22 article-title: Integer polyhedra associated with certain network design problems with connectivity constraints publication-title: SIAM Journal on Discrete Mathematics – volume: 41 start-page: 669 year: 1993 end-page: 693 ident: bib11 article-title: A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem publication-title: Operations Research – volume: 27 start-page: 102 year: 1993 end-page: 117 ident: bib8 article-title: A network-based primal-dual heuristic for the solution of multicommodity network flow problems publication-title: Transportation Science – volume: 28 start-page: 32 year: 1998 end-page: 41 ident: bib12 article-title: Advances in solving the multicommodity flow problem publication-title: Interfaces – volume: 46 start-page: 719 year: 1998 end-page: 728 ident: bib2 article-title: Optimal placement of add/drop multiplexers: heuristic and exact algorithms publication-title: Operations Research – volume: 2 start-page: 474 year: 1992 end-page: 504 ident: bib26 article-title: Facets for polyhedra arising in the design of communication networks with low-connectivity constraints publication-title: SIAM Journal on Optimization – volume: 40 start-page: 309 year: 1992 end-page: 330 ident: bib25 article-title: Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints publication-title: Operations Research – volume: 33 start-page: 82 year: 1985 end-page: 92 ident: bib34 article-title: The cutting stock problem and integer rounding publication-title: Mathematical Programming – volume: 8 start-page: 37 year: 1978 end-page: 91 ident: bib5 article-title: Multicommodity network flows—a survey publication-title: Networks – volume: 43 start-page: 1012 year: 1995 end-page: 1024 ident: bib23 article-title: Polyhedral and computational investigations for designing communication networks with high survivability requirements publication-title: Operations Research – volume: 12 start-page: 934 year: 1964 end-page: 940 ident: bib16 article-title: Removing arcs from a network publication-title: Operations Research – volume: 51 start-page: 574 year: 2000 end-page: 582 ident: bib28 article-title: Survivable capacitated network design problem: new formulation and Lagrangian relaxation publication-title: Journal of the Operational Research Society – volume: 40 start-page: 305 year: 1993 end-page: 324 ident: bib7 article-title: Dual-ascent methods for large-scale multicommodity flow problems publication-title: Naval Research Logistics – volume: 68 start-page: 149 year: 1994 end-page: 167 ident: bib19 article-title: A polyhedral approach to multicommodity survivable network design publication-title: Numerische Mathematik – volume: 41 start-page: 669 issue: 4 year: 1993 ident: 10.1016/j.omega.2006.05.006_bib11 article-title: A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem publication-title: Operations Research doi: 10.1287/opre.41.4.669 – year: 1999 ident: 10.1016/j.omega.2006.05.006_bib31 – volume: 28 start-page: 32 issue: 2 year: 1998 ident: 10.1016/j.omega.2006.05.006_bib12 article-title: Advances in solving the multicommodity flow problem publication-title: Interfaces doi: 10.1287/inte.28.2.32 – volume: 40 start-page: 309 issue: 2 year: 1992 ident: 10.1016/j.omega.2006.05.006_bib25 article-title: Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints publication-title: Operations Research doi: 10.1287/opre.40.2.309 – volume: 8 start-page: 146 year: 1975 ident: 10.1016/j.omega.2006.05.006_bib33 article-title: Facets of the knapsack polytope publication-title: Mathematical Programming doi: 10.1007/BF01580440 – volume: 17 start-page: 1 issue: 2 year: 1993 ident: 10.1016/j.omega.2006.05.006_bib17 article-title: Deterministic network interdiction publication-title: Mathematical and Computer Modelling doi: 10.1016/0895-7177(93)90236-R – volume: 13 start-page: 129 year: 1971 ident: 10.1016/j.omega.2006.05.006_bib20 article-title: On an extension of the maximum-flow minimum-cut theorem to multicommodity flows publication-title: Journal of the Operations Research Society of Japan – volume: 51 start-page: 574 issue: 5 year: 2000 ident: 10.1016/j.omega.2006.05.006_bib28 article-title: Survivable capacitated network design problem: new formulation and Lagrangian relaxation publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2600913 – volume: 46 start-page: 693 issue: 5 year: 2000 ident: 10.1016/j.omega.2006.05.006_bib10 article-title: A decomposition-based pricing procedure for large-scale linear programs: an application to the linear multicommodity flow problem publication-title: Management Science doi: 10.1287/mnsc.46.5.693.12042 – volume: 1 start-page: 303 issue: 3 year: 1999 ident: 10.1016/j.omega.2006.05.006_bib4 article-title: Survivable network design: the state of the art publication-title: Information Systems Frontiers doi: 10.1023/A:1010058513558 – volume: 26 start-page: 209 issue: 2 year: 1978 ident: 10.1016/j.omega.2006.05.006_bib6 article-title: A survey of linear cost multicommodity network flows publication-title: Operations Research doi: 10.1287/opre.26.2.209 – volume: 92 start-page: 425 issue: 3 year: 2002 ident: 10.1016/j.omega.2006.05.006_bib32 article-title: On capacitated network design cut-set polyhedra publication-title: Mathematical Programming Series B doi: 10.1007/s101070100284 – volume: 33 start-page: 82 issue: 1 year: 1985 ident: 10.1016/j.omega.2006.05.006_bib34 article-title: The cutting stock problem and integer rounding publication-title: Mathematical Programming doi: 10.1007/BF01582013 – volume: 40 start-page: 305 issue: 3 year: 1993 ident: 10.1016/j.omega.2006.05.006_bib7 article-title: Dual-ascent methods for large-scale multicommodity flow problems publication-title: Naval Research Logistics doi: 10.1002/1520-6750(199304)40:3<305::AID-NAV3220400303>3.0.CO;2-4 – volume: 2 start-page: 474 issue: 3 year: 1992 ident: 10.1016/j.omega.2006.05.006_bib26 article-title: Facets for polyhedra arising in the design of communication networks with low-connectivity constraints publication-title: SIAM Journal on Optimization doi: 10.1137/0802024 – volume: 8 start-page: 37 issue: 1 year: 1978 ident: 10.1016/j.omega.2006.05.006_bib5 article-title: Multicommodity network flows—a survey publication-title: Networks doi: 10.1002/net.3230080107 – volume: 68 start-page: 149 issue: 1 year: 1994 ident: 10.1016/j.omega.2006.05.006_bib19 article-title: A polyhedral approach to multicommodity survivable network design publication-title: Numerische Mathematik doi: 10.1007/s002110050054 – ident: 10.1016/j.omega.2006.05.006_bib15 doi: 10.1080/07408170600729192 – year: 1992 ident: 10.1016/j.omega.2006.05.006_bib3 – volume: 21 start-page: 82 year: 1985 ident: 10.1016/j.omega.2006.05.006_bib13 article-title: Solving embedded generalized network flow problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(85)90091-8 – volume: 43 start-page: 1012 issue: 6 year: 1995 ident: 10.1016/j.omega.2006.05.006_bib23 article-title: Polyhedral and computational investigations for designing communication networks with high survivability requirements publication-title: Operations Research doi: 10.1287/opre.43.6.1012 – year: 1994 ident: 10.1016/j.omega.2006.05.006_bib29 – volume: 48 start-page: 318 issue: 2 year: 2000 ident: 10.1016/j.omega.2006.05.006_bib9 article-title: Using branch-and-price-and-cut to solve origin–destination integer multicommodity flow problems publication-title: Operations Research doi: 10.1287/opre.48.2.318.12378 – volume: 3 start-page: 502 year: 1990 ident: 10.1016/j.omega.2006.05.006_bib22 article-title: Integer polyhedra associated with certain network design problems with connectivity constraints publication-title: SIAM Journal on Discrete Mathematics doi: 10.1137/0403043 – ident: 10.1016/j.omega.2006.05.006_bib18 – volume: 59 start-page: 57 issue: 1 year: 1995 ident: 10.1016/j.omega.2006.05.006_bib35 article-title: Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(95)90600-K – volume: 129 start-page: 99 issue: 1 year: 2003 ident: 10.1016/j.omega.2006.05.006_bib1 article-title: SONET/SDH ring assignment with capacity constraints publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(02)00236-6 – volume: 46 start-page: 719 issue: 5 year: 1998 ident: 10.1016/j.omega.2006.05.006_bib2 article-title: Optimal placement of add/drop multiplexers: heuristic and exact algorithms publication-title: Operations Research doi: 10.1287/opre.46.5.719 – volume: 12 start-page: 934 issue: 6 year: 1964 ident: 10.1016/j.omega.2006.05.006_bib16 article-title: Removing arcs from a network publication-title: Operations Research doi: 10.1287/opre.12.6.934 – volume: 44 start-page: 12 issue: 1 year: 2004 ident: 10.1016/j.omega.2006.05.006_bib30 article-title: A stochastic integer programming approach to solving a synchronous optical network ring design problem publication-title: Networks doi: 10.1002/net.20009 – volume: 27 start-page: 102 issue: 2 year: 1993 ident: 10.1016/j.omega.2006.05.006_bib8 article-title: A network-based primal-dual heuristic for the solution of multicommodity network flow problems publication-title: Transportation Science doi: 10.1287/trsc.27.2.102 – volume: 46 start-page: 184 issue: 2 year: 1998 ident: 10.1016/j.omega.2006.05.006_bib14 article-title: Stochastic network interdiction publication-title: Operations Research doi: 10.1287/opre.46.2.184 – volume: 46 start-page: 116 issue: 1 year: 1998 ident: 10.1016/j.omega.2006.05.006_bib24 article-title: Designing hierarchical survivable networks publication-title: Operations Research doi: 10.1287/opre.46.1.116 – volume: 10 start-page: 1 issue: 1 year: 1998 ident: 10.1016/j.omega.2006.05.006_bib21 article-title: A cutting plane algorithm for multicommodity survivable network design problems publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.10.1.1 – volume: 26 start-page: 211 issue: 5 year: 2000 ident: 10.1016/j.omega.2006.05.006_bib27 article-title: Bounds for global optimization of capacity expansion and flow assignment problems publication-title: Operations Research Letters doi: 10.1016/S0167-6377(00)00027-4
SSID	ssj0001803
Score	2.1226435
Snippet	We consider the design of a multicommodity flow network, in which point-to-point demands are routed across the network subject to link capacity restrictions....
SourceID	proquest gale repec pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	1057
SubjectTerms	Algorithms Analysis Applied sciences Computing Design and construction Exact sciences and technology Flows in networks. Combinatorial problems Integer programming Integer programming Routing Optimization Computing Mathematical programming Operational research and scientific management Operational research. Management science Optimization Optimization algorithms Routing Studies Telecommunication systems
Title	Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios
URI	https://dx.doi.org/10.1016/j.omega.2006.05.006 http://econpapers.repec.org/article/eeejomega/v_3a36_3ay_3a2008_3ai_3a6_3ap_3a1057-1071.htm https://www.proquest.com/docview/236399877
Volume	36
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] customDbUrl: eissn: 1873-5274 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001803 issn: 0305-0483 databaseCode: AIKHN dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1873-5274 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001803 issn: 0305-0483 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1873-5274 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001803 issn: 0305-0483 databaseCode: ACRLP dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1873-5274 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001803 issn: 0305-0483 databaseCode: AKRWK dateStart: 19730101 isFulltext: true providerName: Library Specific Holdings
link	http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Pb9MwFLa2VkJICPFTlEHlA4ILoUmcOMmxGps6JnaBSbtZrv3SZWqTqMmGuPC3817iVFSCHTg4URNbcp6fP39JP7_H2DuLfpDqFLxEm8yLcpxzmdE43WMIMivSpTC0UfjrhVxcRl-u4qsDdjzshSFZpcP-HtM7tHZXZs6as7ooZt_IVSkgui-JmCTpIRvj-pOmIzaen50vLnaAHKR-nyWZdGrYYAg-1Mm8qg2stPtTgj6vyH8tUA6xH9W6QevlfdqLPV463kIN5o_l6fQJe-x4JZ_3XX_KDqB8xh4MsvbnrKSkZ-uG69JyvV5V26K93jQcKStHCshtJ-TgVc6bWwSPO9pQxTuxIRpmU1nk6jxfVz942cvGG04fcPmqD1rNc12QvJ1TaCh8-a6aF-zy9OT78cJzuRY8E4uk9bTUfi6TYClB-xbCLDcBSDzb3AL4IooBlzFIjLYJ3opNQMG6Mt9H4M5EoMVLNiqrEl4xbqywWWiiXETIF0Wo8Y1LQpLKPAaJmDZh4WBgZVwgcsqHsVaD4uxGdaNCKTKl8mOFpwn7uGtU93E47q8uh5FTe-6kcKW4v-EHGmdF0xs7ZbTbpYCPRoGy1DxAhEPWHMYT9n6vprP43ypO93xm1__QJ7yMscLR4ETKIUijQkHcMU3QXCedX-2aAcBN3-87JbSQePiJpcsnKnSBhS7VWCiHMz5pEqjrdvP6f01yxB52IplOw_OGjdrtLbxFJtYup-zw069g6uYb_vp8fvYb9Vg0oQ
linkProvider	Elsevier
linkToHtml	http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Pb9MwFLbGJgESQvyaKIPhA4ILpUmc2MlxmjYV2HZhk3azXP_oMrVJ1GRDXPjbec9xCpVgBw5upNSWnOfnz5-Tz-8R8s6AH-Qqt2OhdDFOHcy5QiuY7pmNC8PyGdN4UPj0jE8v0i-X2eUWORzOwqCsMmB_j-kercOdSbDmpCnLyTd0VQyIHnEkJiK_R3bSLBG4A_v087fOI86jPkcyqtSg-hB6yIu86qWdq_BJAl-u8H8tTwGvHzWqBdu5PunFBivdWdnG6j8Wp-Mn5HFglfSg7_hTsmWrZ-T-IGp_TipMebZoqaoMVYt5vSq7q2VLgbBSIIDUeBkHrR1tbwA6bvE4FfVSQzDLsjbA1Klb1N9p1YvGW4qvb-m8D1lNnSpR3E4xMBRsvev2Bbk4Pjo_nI5DpoWxzpjoxoqryHERz7hVkbFJ4XRsOVyNM9ZGLM0sLGJWaGUE_JXpGEN1FVEEsF2wWLFdsl3VlX1JqDbMFIlOHUuBLbJEwX6LW5Fzl1kOiDYiyWBgqUMYcsyGsZCD3uxa-lHBBJlcRpmEy4h8XDdq-igcd1fnw8jJDWeSsE7c3fADjrPEyQ2d0iqcUYBHwzBZ8iAGfAPOnGQj8n6jZrD43yrub_jMuv9JhGiZQYW9wYlkwI9WJgyZYy7AXEfer9bNrLXXfb9vJVOMw88PKD6bKFMlFLzVQMEMzvCkIpZX3fLV_5rkLXkwPT89kSefz77ukYdeLuPVPK_Jdre6sW-Ak3WzfT_nfgFWczRw
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Models+and+algorithms+for+the+design+of+survivable+multicommodity+flow+networks+with+general+failure+scenarios&rft.jtitle=Omega+%28Oxford%29&rft.au=Garg%2C+Manish&rft.au=Smith%2C+J.+Cole&rft.date=2008-12-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0483&rft.eissn=1873-5274&rft.volume=36&rft.issue=6&rft.spage=1057&rft.epage=1071&rft_id=info:doi/10.1016%2Fj.omega.2006.05.006&rft.externalDocID=S0305048306000478
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0483&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0483&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0483&client=summon