On the robustness of potential-based flow networks
Potential-based flows provide a simple yet realistic mathematical model of transport in many real-world infrastructure networks such as, e.g., gas or water networks, where the flow along each edge depends on the difference of the potentials at its end nodes. We call a network topology robust if the...
Gespeichert in:
| Veröffentlicht in: | Mathematical programming Jg. 197; H. 1; S. 337 - 374 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.01.2023
|
| Schlagworte: | |
| ISSN: | 0025-5610, 1436-4646 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Potential-based flows provide a simple yet realistic mathematical model of transport in many real-world infrastructure networks such as, e.g., gas or water networks, where the flow along each edge depends on the difference of the potentials at its end nodes. We call a network topology robust if the maximal node potential needed to satisfy a set of demands never increases when demands are decreased. This notion of robustness is motivated by infrastructure networks where users first make reservations for certain demands that may be larger than the actual flows sent later on. In these networks, node potentials correspond to physical quantities such as pressures or hydraulic heads and must be guaranteed to lie within a fixed range, even if the actual amounts are smaller than the previously reserved demands. Our main results are a precise characterization of robust network topologies for the case of point-to-point demands via forbidden node-labeled graph minors, as well as an efficient algorithm for testing robustness. |
|---|---|
| AbstractList | Potential-based flows provide a simple yet realistic mathematical model of transport in many real-world infrastructure networks such as, e.g., gas or water networks, where the flow along each edge depends on the difference of the potentials at its end nodes. We call a network topology robust if the maximal node potential needed to satisfy a set of demands never increases when demands are decreased. This notion of robustness is motivated by infrastructure networks where users first make reservations for certain demands that may be larger than the actual flows sent later on. In these networks, node potentials correspond to physical quantities such as pressures or hydraulic heads and must be guaranteed to lie within a fixed range, even if the actual amounts are smaller than the previously reserved demands. Our main results are a precise characterization of robust network topologies for the case of point-to-point demands via forbidden node-labeled graph minors, as well as an efficient algorithm for testing robustness. |
| Author | Klimm, Max Raber, Rico Pfetsch, Marc E. Skutella, Martin |
| Author_xml | – sequence: 1 givenname: Max orcidid: 0000-0002-9061-2267 surname: Klimm fullname: Klimm, Max email: klimm@math.tu-berlin.de organization: Institute of Mathematics, TU Berlin – sequence: 2 givenname: Marc E. surname: Pfetsch fullname: Pfetsch, Marc E. organization: Department of Mathematics, TU Darmstadt – sequence: 3 givenname: Rico surname: Raber fullname: Raber, Rico organization: Institute of Mathematics, TU Berlin – sequence: 4 givenname: Martin surname: Skutella fullname: Skutella, Martin organization: Institute of Mathematics, TU Berlin |
| BookMark | eNp9z71OwzAUhmELFYm2cANMuQHD8U_sZEQVf1KlLt0txzmBlGBXtquIuycQJoZOZ3rOp3dFFj54JOSWwR0D0PeJAQNNgTMKTCug4wVZMikUlUqqBVkC8JKWisEVWaV0AAAmqmpJ-M4X-R2LGJpTyh5TKkJXHENGn3s70MYmbItuCGPhMY8hfqRrctnZIeHN312T_dPjfvNCt7vn183DljquykzrRjotGwEtuFIozYVAAIdtzXSnBVa6ZJyVVtetUs5W2CJIVTclSKtYLdaEz29dDClF7Mwx9p82fhkG5ifazNFmija_0WacUPUPuT7b3Aefo-2H81TMNE07_g2jOYRT9FPhOfUNvi1tvA |
| CitedBy_id | crossref_primary_10_1007_s10107_025_02207_2 crossref_primary_10_1155_2022_8127055 |
| Cites_doi | 10.3390/data2040040 10.1007/s00186-018-0647-z 10.1287/mnsc.24.7.747 10.1137/0212010 10.1137/0110020 10.1287/mnsc.46.11.1454.12087 10.1137/1.9781611973693 10.1002/(SICI)1097-0037(199603)27:2<109::AID-NET2>3.0.CO;2-O 10.1090/conm/065/891251 10.1287/moor.17.3.581 10.1137/050641776 10.1016/j.ejor.2014.04.023 10.1007/s10107-016-0991-9 10.1137/0109047 10.1006/jctb.1995.1006 10.1287/ijoc.8.3.243 10.1080/02630258408970343 10.1051/ro/1977110202431 10.1006/jagm.1997.0866 10.1002/net.21865 10.1016/S0167-6377(99)00016-4 10.1287/mnsc.5.1.97 10.1109/TCT.1970.1083100 10.1147/rd.43.0311 10.1145/2487241.2487243 10.1090/qam/77398 10.1137/0112029 10.1145/316188.316209 10.1145/380752.380830 10.1007/978-3-642-21527-8_2 10.1016/S0304-0208(08)73470-4 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2022 |
| Copyright_xml | – notice: The Author(s) 2022 |
| DBID | C6C AAYXX CITATION |
| DOI | 10.1007/s10107-021-01760-w |
| DatabaseName | Springer Nature OA Free Journals CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1436-4646 |
| EndPage | 374 |
| ExternalDocumentID | 10_1007_s10107_021_01760_w |
| GrantInformation_xml | – fundername: Einstein Stiftung Berlin funderid: http://dx.doi.org/10.13039/501100006188 – fundername: deutsche forschungsgemeinschaft grantid: CRC/TRR 154, project A07 funderid: http://dx.doi.org/10.13039/501100001659 |
| GroupedDBID | --K --Z -52 -5D -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 199 1B1 1N0 1OL 1SB 203 28- 29M 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 6TJ 78A 7WY 88I 8AO 8FE 8FG 8FL 8TC 8UJ 8VB 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACNCT ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFFNX AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS C6C CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBA EBLON EBR EBS EBU ECS EDO EIOEI EJD EMI EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IAO IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV KOW L6V LAS LLZTM M0C M0N M2P M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQ- NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9R PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS QWB R4E R89 R9I RHV RIG RNI RNS ROL RPX RPZ RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SDD SDH SDM SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TH9 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 XPP YLTOR Z45 Z5O Z7R Z7S Z7X Z7Y Z7Z Z81 Z83 Z86 Z88 Z8M Z8N Z8R Z8T Z8W Z92 ZL0 ZMTXR ZWQNP ~02 ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADXHL AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB |
| ID | FETCH-LOGICAL-c265t-9b4c74b30d0c5367233e00ced917f73e8751215a79d66ca8ede0469b504a6193 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000753228700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0025-5610 |
| IngestDate | Sat Nov 29 03:34:03 EST 2025 Tue Nov 18 22:22:44 EST 2025 Fri Feb 21 02:45:33 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | 05C21 90B10 90C35 05C83 Node-labeled graph minors Potential-based network flows Robustness |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c265t-9b4c74b30d0c5367233e00ced917f73e8751215a79d66ca8ede0469b504a6193 |
| ORCID | 0000-0002-9061-2267 |
| OpenAccessLink | https://link.springer.com/10.1007/s10107-021-01760-w |
| PageCount | 38 |
| ParticipantIDs | crossref_primary_10_1007_s10107_021_01760_w crossref_citationtrail_10_1007_s10107_021_01760_w springer_journals_10_1007_s10107_021_01760_w |
| PublicationCentury | 2000 |
| PublicationDate | 20230100 2023-01-00 |
| PublicationDateYYYYMMDD | 2023-01-01 |
| PublicationDate_xml | – month: 1 year: 2023 text: 20230100 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg |
| PublicationSubtitle | A Publication of the Mathematical Optimization Society |
| PublicationTitle | Mathematical programming |
| PublicationTitleAbbrev | Math. Program |
| PublicationYear | 2023 |
| Publisher | Springer Berlin Heidelberg |
| Publisher_xml | – name: Springer Berlin Heidelberg |
| References | Kabadi, Yan, Du, Nair (CR26) 2008; 23 Goyal, Olver, Shepherd (CR20) 2013; 60 Groß, Pfetsch, Schewe, Schmidt, Skutella (CR22) 2018 Ben-Tal, Nemirovski (CR3) 1999; 25 Friedmann, Robertson, Seymour (CR16) 1987; 65 Grimm, Schewe, Schmidt, Zöttl (CR21) 2018 Bienstock, Günlük (CR4) 1996; 8 Gomory, Hu (CR18) 1962; 10 CR13 CR35 Talluri (CR36) 1996; 27 Rockafellar (CR31) 1984 CR32 Collins, Cooper, Helgason, Kennington, LeBlanc (CR10) 1978; 24 Gomory, Hu (CR19) 1964; 12 Gomory, Hu (CR17) 1961; 9 Àlvarez-Miranda, Cacchiani, Lodi, Parriani, Schmidt (CR1) 2014; 238 Ben-Tal, Ghaoui, Nemirovski (CR2) 2009 Chou, Frank (CR9) 1970; 17 De Wolf, Smeers (CR11) 2000; 46 Robertson, Seymour (CR30) 1995; 63 Fingerhut, Suri, Turner (CR14) 1997; 24 CR6 Birkhoff, Diaz (CR5) 1956; 13 CR29 Cacchiani, Jünger, Liers, Lodi, Schmidt (CR7) 2016; 157 CR23 Schmidt, Aßmann, Burlacu, Humpola, Joormann, Kanelakis, Koch, Oucherif, Pfetsch, Schewe, Schwarz, Sirvent (CR33) 2017; 2 Diestel (CR12) 2018 Maugis (CR28) 1977; 11 Koch, Hiller, Pfetsch, Schewe (CR27) 2015 Ford, Fulkerson (CR15) 1958; 5 Hendrickson, Janson (CR25) 1984; 1 Chien (CR8) 1960; 4 Sridhar, Chandrasekaran (CR34) 1992; 17 Gusfield (CR24) 1983; 12 1760_CR32 LR Ford Jr (1760_CR15) 1958; 5 RE Gomory (1760_CR18) 1962; 10 RE Gomory (1760_CR17) 1961; 9 T Koch (1760_CR27) 2015 A Ben-Tal (1760_CR3) 1999; 25 1760_CR6 V Cacchiani (1760_CR7) 2016; 157 M Collins (1760_CR10) 1978; 24 N Robertson (1760_CR30) 1995; 63 W Chou (1760_CR9) 1970; 17 JA Fingerhut (1760_CR14) 1997; 24 R Diestel (1760_CR12) 2018 RE Gomory (1760_CR19) 1964; 12 N Goyal (1760_CR20) 2013; 60 KT Talluri (1760_CR36) 1996; 27 SN Kabadi (1760_CR26) 2008; 23 1760_CR13 1760_CR35 1760_CR23 G Birkhoff (1760_CR5) 1956; 13 D Gusfield (1760_CR24) 1983; 12 RT Rockafellar (1760_CR31) 1984 E Àlvarez-Miranda (1760_CR1) 2014; 238 M Groß (1760_CR22) 2018 H Friedmann (1760_CR16) 1987; 65 RT Chien (1760_CR8) 1960; 4 M Schmidt (1760_CR33) 2017; 2 O Bienstock (1760_CR4) 1996; 8 CT Hendrickson (1760_CR25) 1984; 1 V Grimm (1760_CR21) 2018 1760_CR29 A Ben-Tal (1760_CR2) 2009 JJ Maugis (1760_CR28) 1977; 11 D De Wolf (1760_CR11) 2000; 46 R Sridhar (1760_CR34) 1992; 17 |
| References_xml | – volume: 2 start-page: 40 issue: 4 year: 2017 ident: CR33 article-title: GasLib—a library of gas network instances publication-title: Data doi: 10.3390/data2040040 – year: 2018 ident: CR21 article-title: A multilevel model of the European entry-exit gas market publication-title: Math. Methods Oper. Res. doi: 10.1007/s00186-018-0647-z – volume: 24 start-page: 747 issue: 7 year: 1978 end-page: 760 ident: CR10 article-title: Solving the pipe network analysis problem using optimization techniques publication-title: Manag. Sci. doi: 10.1287/mnsc.24.7.747 – volume: 12 start-page: 157 year: 1983 end-page: 165 ident: CR24 article-title: Simple constructions for the multi-terminal network flow synthesis publication-title: SIAM J. Comput. doi: 10.1137/0212010 – volume: 10 start-page: 260 year: 1962 end-page: 283 ident: CR18 article-title: An application of generalized linear programming to network flows publication-title: J. Soc. Ind. Appl. Math. doi: 10.1137/0110020 – volume: 46 start-page: 1454 issue: 11 year: 2000 end-page: 1465 ident: CR11 article-title: The gas transmission problem solved by an extension of the simplex algorithm publication-title: Manag. Sci. doi: 10.1287/mnsc.46.11.1454.12087 – ident: CR35 – ident: CR6 – year: 2015 ident: CR27 publication-title: Evaluating Gas Network Capacities doi: 10.1137/1.9781611973693 – ident: CR29 – volume: 27 start-page: 109 year: 1996 end-page: 115 ident: CR36 article-title: Network synthesis with few edges publication-title: Networks doi: 10.1002/(SICI)1097-0037(199603)27:2<109::AID-NET2>3.0.CO;2-O – volume: 65 start-page: 229 year: 1987 end-page: 261 ident: CR16 article-title: The metamathematics of the graph minor theorem publication-title: Contemp. Math. doi: 10.1090/conm/065/891251 – year: 2018 ident: CR12 publication-title: Graph Theory – volume: 17 start-page: 581 year: 1992 end-page: 585 ident: CR34 article-title: Integer solution to synthesis of communication networks publication-title: Math. Oper. Res. doi: 10.1287/moor.17.3.581 – volume: 23 start-page: 136 issue: 1 year: 2008 end-page: 154 ident: CR26 article-title: Integer exact network synthesis problem publication-title: SIAM J. Discrete Math. doi: 10.1137/050641776 – year: 1984 ident: CR31 publication-title: Network Flows and Monotropic Optimization – volume: 238 start-page: 711 year: 2014 end-page: 723 ident: CR1 article-title: Single-commodity robust network design problem: complexity, instances and heuristic solutions publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2014.04.023 – volume: 157 start-page: 297 year: 2016 end-page: 342 ident: CR7 article-title: Single-commodity robust network design with finite and Hose demand sets publication-title: Math. Progr. Ser. B doi: 10.1007/s10107-016-0991-9 – volume: 9 start-page: 551 year: 1961 end-page: 570 ident: CR17 article-title: Multi-terminal network flows publication-title: J. Soc. Ind. Appl. Math. doi: 10.1137/0109047 – ident: CR23 – volume: 63 start-page: 65 issue: 1 year: 1995 end-page: 110 ident: CR30 article-title: Graph minors. XIII. The disjoint paths problem publication-title: J. Comb. Theory Ser. B doi: 10.1006/jctb.1995.1006 – volume: 8 start-page: 243 year: 1996 end-page: 259 ident: CR4 article-title: Capacitated network design—polyhedral structure and computation publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.8.3.243 – volume: 1 start-page: 195 issue: 4 year: 1984 end-page: 203 ident: CR25 article-title: A common network flow formulation for several civil engineering problems publication-title: Civ. Eng. Syst. doi: 10.1080/02630258408970343 – year: 2009 ident: CR2 publication-title: Robust Optimization. Princeton Series in Applied Mathematics – volume: 11 start-page: 243 issue: 2 year: 1977 end-page: 248 ident: CR28 article-title: Étude de réseaux de transport et de distribution de fluide publication-title: RAIRO Oper. Res. doi: 10.1051/ro/1977110202431 – ident: CR13 – volume: 24 start-page: 287 issue: 2 year: 1997 end-page: 309 ident: CR14 article-title: Designing least-cost nonblocking broadband networks publication-title: J. Algorithms doi: 10.1006/jagm.1997.0866 – year: 2018 ident: CR22 article-title: Algorithmic results for potential-based flows: easy and hard cases publication-title: Networks doi: 10.1002/net.21865 – volume: 25 start-page: 1 year: 1999 end-page: 13 ident: CR3 article-title: Robust solutions of uncertain linear programs publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(99)00016-4 – ident: CR32 – volume: 5 start-page: 97 year: 1958 end-page: 101 ident: CR15 article-title: A suggested computation for maximal multi-commodity network flows publication-title: Manag. Sci. doi: 10.1287/mnsc.5.1.97 – volume: 17 start-page: 192 year: 1970 end-page: 197 ident: CR9 article-title: Survivable communication networks and the terminal capacity matrix publication-title: IEEE Trans. Circuit Theory doi: 10.1109/TCT.1970.1083100 – volume: 4 start-page: 311 issue: 3 year: 1960 end-page: 320 ident: CR8 article-title: Synthesis of a communication net publication-title: IBM J. Res. Dev. doi: 10.1147/rd.43.0311 – volume: 60 start-page: 1 issue: 3 year: 2013 end-page: 17 ident: CR20 article-title: The VPN conjecture is true publication-title: J. ACM doi: 10.1145/2487241.2487243 – volume: 13 start-page: 431 issue: 4 year: 1956 end-page: 443 ident: CR5 article-title: Non-linear network problems publication-title: Q. Appl. Math. doi: 10.1090/qam/77398 – volume: 12 start-page: 348 year: 1964 end-page: 369 ident: CR19 article-title: Synthesis of a communication network publication-title: J. Soc. Ind. Appl. Math. doi: 10.1137/0112029 – volume: 10 start-page: 260 year: 1962 ident: 1760_CR18 publication-title: J. Soc. Ind. Appl. Math. doi: 10.1137/0110020 – volume: 13 start-page: 431 issue: 4 year: 1956 ident: 1760_CR5 publication-title: Q. Appl. Math. doi: 10.1090/qam/77398 – ident: 1760_CR13 doi: 10.1145/316188.316209 – ident: 1760_CR23 doi: 10.1145/380752.380830 – ident: 1760_CR35 – volume: 12 start-page: 157 year: 1983 ident: 1760_CR24 publication-title: SIAM J. Comput. doi: 10.1137/0212010 – volume: 157 start-page: 297 year: 2016 ident: 1760_CR7 publication-title: Math. Progr. Ser. B doi: 10.1007/s10107-016-0991-9 – volume: 5 start-page: 97 year: 1958 ident: 1760_CR15 publication-title: Manag. Sci. doi: 10.1287/mnsc.5.1.97 – year: 2018 ident: 1760_CR22 publication-title: Networks doi: 10.1002/net.21865 – volume: 11 start-page: 243 issue: 2 year: 1977 ident: 1760_CR28 publication-title: RAIRO Oper. Res. doi: 10.1051/ro/1977110202431 – volume: 9 start-page: 551 year: 1961 ident: 1760_CR17 publication-title: J. Soc. Ind. Appl. Math. doi: 10.1137/0109047 – volume: 25 start-page: 1 year: 1999 ident: 1760_CR3 publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(99)00016-4 – volume: 60 start-page: 1 issue: 3 year: 2013 ident: 1760_CR20 publication-title: J. ACM doi: 10.1145/2487241.2487243 – volume: 24 start-page: 287 issue: 2 year: 1997 ident: 1760_CR14 publication-title: J. Algorithms doi: 10.1006/jagm.1997.0866 – ident: 1760_CR32 – volume-title: Evaluating Gas Network Capacities year: 2015 ident: 1760_CR27 doi: 10.1137/1.9781611973693 – year: 2018 ident: 1760_CR21 publication-title: Math. Methods Oper. Res. doi: 10.1007/s00186-018-0647-z – volume: 238 start-page: 711 year: 2014 ident: 1760_CR1 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2014.04.023 – volume: 8 start-page: 243 year: 1996 ident: 1760_CR4 publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.8.3.243 – volume: 17 start-page: 192 year: 1970 ident: 1760_CR9 publication-title: IEEE Trans. Circuit Theory doi: 10.1109/TCT.1970.1083100 – volume: 12 start-page: 348 year: 1964 ident: 1760_CR19 publication-title: J. Soc. Ind. Appl. Math. doi: 10.1137/0112029 – volume: 17 start-page: 581 year: 1992 ident: 1760_CR34 publication-title: Math. Oper. Res. doi: 10.1287/moor.17.3.581 – volume: 27 start-page: 109 year: 1996 ident: 1760_CR36 publication-title: Networks doi: 10.1002/(SICI)1097-0037(199603)27:2<109::AID-NET2>3.0.CO;2-O – volume: 1 start-page: 195 issue: 4 year: 1984 ident: 1760_CR25 publication-title: Civ. Eng. Syst. doi: 10.1080/02630258408970343 – volume: 4 start-page: 311 issue: 3 year: 1960 ident: 1760_CR8 publication-title: IBM J. Res. Dev. doi: 10.1147/rd.43.0311 – ident: 1760_CR6 doi: 10.1007/978-3-642-21527-8_2 – volume: 24 start-page: 747 issue: 7 year: 1978 ident: 1760_CR10 publication-title: Manag. Sci. doi: 10.1287/mnsc.24.7.747 – ident: 1760_CR29 doi: 10.1016/S0304-0208(08)73470-4 – volume: 46 start-page: 1454 issue: 11 year: 2000 ident: 1760_CR11 publication-title: Manag. Sci. doi: 10.1287/mnsc.46.11.1454.12087 – volume-title: Network Flows and Monotropic Optimization year: 1984 ident: 1760_CR31 – volume: 2 start-page: 40 issue: 4 year: 2017 ident: 1760_CR33 publication-title: Data doi: 10.3390/data2040040 – volume: 63 start-page: 65 issue: 1 year: 1995 ident: 1760_CR30 publication-title: J. Comb. Theory Ser. B doi: 10.1006/jctb.1995.1006 – volume-title: Robust Optimization. Princeton Series in Applied Mathematics year: 2009 ident: 1760_CR2 – volume: 65 start-page: 229 year: 1987 ident: 1760_CR16 publication-title: Contemp. Math. doi: 10.1090/conm/065/891251 – volume-title: Graph Theory year: 2018 ident: 1760_CR12 – volume: 23 start-page: 136 issue: 1 year: 2008 ident: 1760_CR26 publication-title: SIAM J. Discrete Math. doi: 10.1137/050641776 |
| SSID | ssj0001388 |
| Score | 2.3877337 |
| Snippet | Potential-based flows provide a simple yet realistic mathematical model of transport in many real-world infrastructure networks such as, e.g., gas or water... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 337 |
| SubjectTerms | Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical |
| Title | On the robustness of potential-based flow networks |
| URI | https://link.springer.com/article/10.1007/s10107-021-01760-w |
| Volume | 197 |
| WOSCitedRecordID | wos000753228700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1436-4646 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001388 issn: 0025-5610 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB509aAH3-L6IgdvGugjTdKjiIsXV9FF9laadArC0i7brv37Jn2suyALegxMS5lOZuZLZr4BuOFSqhSZoi4PA8pUwGiIytiycjEQobL9mvWwCTEcyvE4fG2bwoqu2r27kqw99VKzm2uP1TwLfwV3aLUJWybcSTuw4e39Y-F_XV_KblCrzQ7aVpnf37EajlbvQusQM9j_38cdwF6bUpL7xgYOYQOzI9hdIho0q-cFO2txDN5LRsySzHI1L0rr60iekmle2sqheEJtZEtIOskrkjVV4sUJjAaPo4cn2s5OoNrjQUlDxbRgyncSRwc-F57vo-NoTAw8S4WPBqZYXolYhAnnOpaYoEXKKnBYbDCVfwq9LM_wDIhAA5kYw9RmAuYHSi5UrBTGqNMQZdoHt9NgpFtecTveYhL9MCJb5URGOVGtnKjqw-3imWnDqrFW-q5TetTusGKN-PnfxC9gx46Qb45VLqFXzuZ4Bdv6q_wsZte1aX0DYnTG7A |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90CuqD3-L87INvGmjXNEkfRRwTtyk6ZG-lSa8gjHasnfv3TfoxN5CBPgaupVwvd_dL7n4HcMOEkDFSSRzme4RKjxIfpbZl6aDHfWn6NYthE7zfF8Oh_1o1hWV1tXt9JVl46oVmN8ccq7UM_OXMJrN12KA6YhnG_Lf3j7n_dVwh6kGtJjuoWmV-f8dyOFq-Cy1CTHvvfx-3D7tVSmndlzZwAGuYHMLOAtGgXvXm7KzZEbReEksvrUkqp1lufJ2VxtY4zU3lUDgiJrJFVjxKZ1ZSVolnxzBoPw4eOqSanUBUi3k58SVVnErXjmzluYy3XBdtW2Gk4VnMXdQwxfBKhNyPGFOhwAgNUpaeTUONqdwTaCRpgqdgcdSQiVKMTSagf6BgXIZSYogq9lHETXBqDQaq4hU34y1GwQ8jslFOoJUTFMoJZk24nT8zLlk1Vkrf1UoPqh2WrRA_-5v4NWx1Br1u0H3qP5_DthknXx6xXEAjn0zxEjbVV_6ZTa4KM_sGv_LJ0A |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED90iuiD3-L8zINvGtaPNEkfRR2KOgcO2Vtp0gSE0Y61c_--SdvNDWQgPgauablcc_dL7n4HcEU5F1oRgV0aBpiIgOBQCWPLwlUBC4Wt1yybTbBOh_f7YXeuir_Mdp9eSVY1DZalKS1aw0S35grfXHvE5lkozKiDJ6uwRmwivcXr7x-zvdj1OZ82bbWRQl028_sci65p8V60dDftnf9_6C5s16Emuq1sYw9WVLoPW3MEhGb0OmNtzQ_Ae0uRGaJRJsZ5YfdAlGk0zOz7jJli6_ESpAfZBKVV9nh-CL32Q-_uEdc9FbD0aFDgUBDJiPCdxJGBT5nn-8pxpEoMbNPMVwa-WL6JmIUJpTLmKlEWQYvAIbHBWv4RNNIsVceAmDJQihClbYRgFpZTJmIhVKykDhXXTXCn2oxkzTdu214Moh-mZKucyCgnKpUTTZpwPXtmWLFtLJW-mS5AVP95-RLxk7-JX8JG974dvTx1nk9h03aZr05ezqBRjMbqHNblV_GZjy5Ki_sG9CHStA |
| 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=On+the+robustness+of+potential-based+flow+networks&rft.jtitle=Mathematical+programming&rft.au=Klimm%2C+Max&rft.au=Pfetsch%2C+Marc+E.&rft.au=Raber%2C+Rico&rft.au=Skutella%2C+Martin&rft.date=2023-01-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=0025-5610&rft.eissn=1436-4646&rft.volume=197&rft.issue=1&rft.spage=337&rft.epage=374&rft_id=info:doi/10.1007%2Fs10107-021-01760-w&rft.externalDocID=10_1007_s10107_021_01760_w |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0025-5610&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0025-5610&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0025-5610&client=summon |