{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:34:10Z","timestamp":1760056450338,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031931116"},{"type":"electronic","value":"9783031931123"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-93112-3_11","type":"book-chapter","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T04:55:47Z","timestamp":1749531347000},"page":"142-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Valid Cuts for\u00a0the\u00a0Design of\u00a0Potential-Based Flow Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-0906-8828","authenticated-orcid":false,"given":"Pascal","family":"B\u00f6rner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9061-2267","authenticated-orcid":false,"given":"Max","family":"Klimm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7699-7018","authenticated-orcid":false,"given":"Annette","family":"Lutz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0947-7193","authenticated-orcid":false,"given":"Marc E.","family":"Pfetsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9814-1703","authenticated-orcid":false,"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8505-3614","authenticated-orcid":false,"given":"Lea","family":"Strubberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,4]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/j.ejor.2014.04.023","volume":"238","author":"E \u00c0lvarez-Miranda","year":"2014","unstructured":"\u00c0lvarez-Miranda, E., Cacchiani, V., Lodi, A., Parriani, T., Schmidt, D.R.: Single-commodity robust network design problem: complexity, instances and heuristic solutions. Eur. J. Oper. Res. 238, 711\u2013723 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2014.04.023","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/j.ejor.2007.12.045","volume":"197","author":"J Andr\u00e9","year":"2009","unstructured":"Andr\u00e9, J., Bonnans, F., Cornibert, L.: Optimization of capacity expansion planning for gas transportation networks. Eur. J. Oper. Res. 197(3), 1019\u20131027 (2009). https:\/\/doi.org\/10.1016\/j.ejor.2007.12.045","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s11081-009-9094-2","volume":"12","author":"J Andr\u00e9","year":"2011","unstructured":"Andr\u00e9, J., Bonnans, J.F.: Optimal structure of gas transmission trunklines. Optim. Eng. 12(1), 175\u2013198 (2011). https:\/\/doi.org\/10.1007\/s11081-009-9094-2","journal-title":"Optim. Eng."},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1287\/opre.1110.1001","volume":"60","author":"F Babonneau","year":"2012","unstructured":"Babonneau, F., Nesterov, Y., Vial, J.P.: Design and operations of gas transmission networks. Oper. Res. 60(1), 34\u201347 (2012). https:\/\/doi.org\/10.1287\/opre.1110.1001","journal-title":"Oper. Res."},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Farias\u00a0de Barros, H., Alvarez-Herault, M.C., Raison, B., Tran, Q.T.: Optimal AC\/DC distribution systems expansion planning from DSO\u2019s perspective considering topological constraints. IEEE Trans. Power Deliv. 38(5), 3417\u20133428 (2023). https:\/\/doi.org\/10.1109\/TPWRD.2023.3277089","DOI":"10.1109\/TPWRD.2023.3277089"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1090\/qam\/77398","volume":"13","author":"G Birkhoff","year":"1956","unstructured":"Birkhoff, G., Diaz, J.B.: Non-linear network problems. Quart. Appl. Math. 13(4), 431\u2013443 (1956)","journal-title":"Quart. Appl. Math."},{"key":"11_CR7","unstructured":"Bolusani, S., et al.: The SCIP Optimization Suite 9.0. Technical report, Optimization Online (2024). https:\/\/optimization-online.org\/2024\/02\/the-scip-optimization-suite-9-0\/"},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/ijoc.2016.0697","volume":"28","author":"C Borraz-S\u00e1nchez","year":"2016","unstructured":"Borraz-S\u00e1nchez, C., Bent, R., Backhaus, S., Hijazi, H., Hentenryck, P.V.: Convex relaxations for gas expansion planning. INFORMS J. Comput. 28(4), 645\u2013656 (2016). https:\/\/doi.org\/10.1287\/ijoc.2016.0697","journal-title":"INFORMS J. Comput."},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Bragalli, C., D\u2019Ambrosio, C., L.J., Lodi, A., Toth, P.: On the optimal design of water distribution networks: a practical MINLP approach. Optim Eng. 13, 219\u2013246 (2012). https:\/\/doi.org\/10.1007\/s11081-011-9141-7","DOI":"10.1007\/s11081-011-9141-7"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-21527-8_2","volume-title":"Network Optimization","author":"C Buchheim","year":"2011","unstructured":"Buchheim, C., Liers, F., Sanit\u00e0, L.: An exact algorithm for robust network design. In: Pahl, J., Reiners, T., Vo\u00df, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 7\u201317. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21527-8_2"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1137\/0110020","volume":"10","author":"RE Gomory","year":"1962","unstructured":"Gomory, R.E., Hu, T.C.: An application of generalized linear programming to network flows. J. Soc. Ind. Appl. Math. 10, 260\u2013283 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1002\/net.21865","volume":"73","author":"M Gro\u00df","year":"2019","unstructured":"Gro\u00df, M., Pfetsch, M.E., Schewe, L., Schmidt, M., Skutella, M.: Algorithmic results for potential-based flows: easy and hard cases. Networks 73(3), 306\u2013324 (2019). https:\/\/doi.org\/10.1002\/net.21865","journal-title":"Networks"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1137\/0212010","volume":"12","author":"D Gusfield","year":"1983","unstructured":"Gusfield, D.: Simple constructions for the multi-terminal network flow synthesis. SIAM J. Comput. 12, 157\u2013165 (1983). https:\/\/doi.org\/10.1137\/0212010","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/net.22038","volume":"79","author":"O Habeck","year":"2021","unstructured":"Habeck, O., Pfetsch, M.E.: Combinatorial acyclicity models for potential-based flows. Networks 79(1), 83\u2013104 (2021). https:\/\/doi.org\/10.1002\/net.22038","journal-title":"Networks"},{"issue":"1\u20133","key":"11_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01582879","volume":"52","author":"CT Hansen","year":"1991","unstructured":"Hansen, C.T., Madsen, K., Nielsen, H.B.: Optimization of pipe networks. Math. Program. 52(1\u20133), 45\u201358 (1991). https:\/\/doi.org\/10.1007\/BF01582879","journal-title":"Math. Program."},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Humpola, J.: Gas Network Optimization by MINLP. Ph.D. thesis, TU Berlin (2014). https:\/\/doi.org\/10.14279\/depositonce-4255","DOI":"10.14279\/depositonce-4255"},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00291-015-0390-2","volume":"38","author":"J Humpola","year":"2015","unstructured":"Humpola, J., F\u00fcgenschuh, A., Koch, T.: Valid inequalities for the topology optimization problem in gas network design. OR Spect. 38(3), 597\u2013631 (2015). https:\/\/doi.org\/10.1007\/s00291-015-0390-2","journal-title":"OR Spect."},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Humpola, J., Serrano, F.: Sufficient pruning conditions for MINLP in gas network design. EURO J. Comput. Optim. (3), 239\u2013261 (2016). https:\/\/doi.org\/10.1007\/s13675-016-0077-8","DOI":"10.1007\/s13675-016-0077-8"},{"issue":"4","key":"11_CR19","first-page":"2287","volume":"48","author":"M Klimm","year":"2023","unstructured":"Klimm, M., Pfetsch, M.E., Raber, R., Skutella, M.: Reduction of potential-based flow networks. Math. Oper. Res. 48(4), 2287\u20132303 (2023)","journal-title":"Math. Oper. Res."},{"key":"11_CR20","unstructured":"Lehmann, K., Grastien, A., Van\u00a0Hentenryck, P.: The Complexity of DC-Switching Problems. Preprint 1411.4369, arXiv (2014). https:\/\/arxiv.org\/abs\/1411.4369"},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1007\/s10898-024-01424-x","volume":"90","author":"Y Li","year":"2024","unstructured":"Li, Y., Dey, S.S., Sahinidis, N.V.: A reformulation-enumeration MINLP algorithm for gas network design. J. Glob. Optim. 90(4), 931\u2013963 (2024). https:\/\/doi.org\/10.1007\/s10898-024-01424-x","journal-title":"J. Glob. Optim."},{"key":"11_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2024.108897","volume":"192","author":"Y Li","year":"2025","unstructured":"Li, Y., Dey, S.S., Sahinidis, N.V., Susarla, N., Zamarripa, M.A., Drouven, M.G.: Optimizing the design and operation of water networks: Two decomposition approaches. Comput. Chem. Eng. 192, 108897 (2025). https:\/\/doi.org\/10.1016\/j.compchemeng.2024.108897","journal-title":"Comput. Chem. Eng."},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"McCormick, S.T.: Submodular function minimization. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Discrete Optimization, Handbooks in Operations Research and Management Science, vol.\u00a012, pp. 321\u2013391. Elsevier (2005). https:\/\/doi.org\/10.1016\/S0927-0507(05)12007-6","DOI":"10.1016\/S0927-0507(05)12007-6"},{"key":"11_CR24","unstructured":"Raber, R.: Optimization, reduction, and robustness of potential-based flow networks. Dissertation, Technische Universit\u00e4t Berlin (2022)"},{"issue":"60","key":"11_CR25","doi-asserted-by":"publisher","first-page":"32136","DOI":"10.1016\/j.ijhydene.2019.10.080","volume":"44","author":"M Reu\u00df","year":"2019","unstructured":"Reu\u00df, M.: Modeling hydrogen networks for future energy systems: A comparison of linear and nonlinear approaches. Int. J. Hydrog. Energy 44(60), 32136\u201332150 (2019). https:\/\/doi.org\/10.1016\/j.ijhydene.2019.10.080","journal-title":"Int. J. Hydrog. Energy"},{"key":"11_CR26","unstructured":"Rockafellar, R.T.: Network Flows and Monotropic Optimization. Wiley-Interscience (1984)"},{"issue":"2","key":"11_CR27","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11081-017-9371-4","volume":"19","author":"J Schweiger","year":"2018","unstructured":"Schweiger, J., Liers, F.: A decomposition approach for optimal gas network extension with a finite set of demand scenarios. Optim. Eng. 19(2), 297\u2013326 (2018). https:\/\/doi.org\/10.1007\/s11081-017-9371-4","journal-title":"Optim. Eng."},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Talluri, K.T.: Network synthesis with few edges. Networks 27, 109\u2013115 (1996). https:\/\/doi.org\/10.1002\/(SICI)1097-0037(199603)27:2<109::AID-NET2>3.0.CO;2-O","DOI":"10.1002\/(SICI)1097-0037(199603)27:2<109::AID-NET2>3.0.CO;2-O"},{"key":"11_CR29","unstructured":"Th\u00fcrauf, J., Gr\u00fcbel, J., Schmidt, M.: Adjustable robust nonlinear network design under demand uncertainties. Preprint, Optimization Online (2024). https:\/\/optimization-online.org\/?p=26035"},{"issue":"1","key":"11_CR30","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006). https:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."},{"issue":"4","key":"11_CR31","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1002\/net.3230200402","volume":"20","author":"DK Wagner","year":"1990","unstructured":"Wagner, D.K.: Disjoint $$(s, t)$$-cuts in a network. Networks 20(4), 361\u2013371 (1990). https:\/\/doi.org\/10.1002\/net.3230200402","journal-title":"Networks"},{"issue":"4","key":"11_CR32","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1287\/opre.44.4.596","volume":"44","author":"D de Wolf","year":"1996","unstructured":"de Wolf, D., Smeers, Y.: Optimal dimensioning of pipe networks with application to gas transmission networks. Oper. Res. 44(4), 596\u2013608 (1996). https:\/\/doi.org\/10.1287\/opre.44.4.596","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-93112-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T10:53:28Z","timestamp":1760007208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-93112-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031931116","9783031931123"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-93112-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests."}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Baltimore, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco25.cs.jhu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}