{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:13:06Z","timestamp":1781345586662,"version":"3.54.1"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T00:00:00Z","timestamp":1716595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T00:00:00Z","timestamp":1716595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GRK 2434"],"award-info":[{"award-number":["GRK 2434"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100019180","name":"HORIZON EUROPE European Research Council","doi-asserted-by":"publisher","award":["ScaleOpt-757481"],"award-info":[{"award-number":["ScaleOpt-757481"]}],"id":[{"id":"10.13039\/100019180","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100019180","name":"HORIZON EUROPE European Research Council","doi-asserted-by":"publisher","award":["EXC-2046\/1, project ID: 390685689"],"award-info":[{"award-number":["EXC-2046\/1, project ID: 390685689"]}],"id":[{"id":"10.13039\/100019180","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10107-024-02096-x","type":"journal-article","created":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T06:02:04Z","timestamp":1716616924000},"page":"377-406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["ReLU neural networks of polynomial size for exact maximum flow computation"],"prefix":"10.1007","volume":"210","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5646-8567","authenticated-orcid":false,"given":"Christoph","family":"Hertrich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leon","family":"Sering","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"key":"2096_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice Hall, Upper Saddle River, New Jersey, USA (1993)"},{"key":"2096_CR2","unstructured":"Ali, M.M., Kamoun, F.: A neural network approach to the maximum flow problem. In: IEEE Global Telecommunications Conference GLOBECOM\u201991: Countdown to the New Millennium. Conference Record, pp 130\u2013134 (1991)"},{"key":"2096_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624216","volume-title":"Neural network learning: Theoretical foundations","author":"M Anthony","year":"1999","unstructured":"Anthony, M., Bartlett, P.L.: Neural network learning: Theoretical foundations. Cambridge University Press, Cambridge (1999)"},{"key":"2096_CR4","unstructured":"Arora, R., Basu, A., Mianjy, P., et al.: Understanding deep neural networks with rectified linear units. In: International Conference on Learning Representations (2018)"},{"key":"2096_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational complexity: a modern approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational complexity: a modern approach. Cambridge University Press, Cambridge (2009)"},{"issue":"7","key":"2096_CR6","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1016\/0893-6080(96)00130-X","volume":"9","author":"V Beiu","year":"1996","unstructured":"Beiu, V., Taylor, J.G.: On the circuit complexity of sigmoid feedforward neural networks. Neural Netw. 9(7), 1155\u20131171 (1996)","journal-title":"Neural Netw."},{"key":"2096_CR7","unstructured":"Bello, I., Pham, H., Le, Q.V., et\u00a0al.: Neural combinatorial optimization with reinforcement learning. arXiv:1611.09940 (2016)"},{"key":"2096_CR8","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. arXiv:1811.06128 (2018)"},{"key":"2096_CR9","doi-asserted-by":"crossref","unstructured":"Berner, J., Grohs, P., Kutyniok, G., et\u00a0al.: The modern mathematics of deep learning. arXiv:2105.04026 (2021)","DOI":"10.1017\/9781009025096.002"},{"key":"2096_CR10","unstructured":"Bertschinger, D., Hertrich, C., Jungeblut, P., et\u00a0al.: Training fully connected neural networks is $$\\exists \\mathbb{R}$$-complete. arXiv:2204.01368 (2022)"},{"issue":"1","key":"2096_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Am. Math. Soc. 21(1), 1\u201346 (1989)","journal-title":"Bull. Am. Math. Soc."},{"key":"2096_CR12","doi-asserted-by":"crossref","unstructured":"Chen, L., Kyng, R., Liu, Y.P., et\u00a0al.: Maximum flow and minimum-cost flow in almost-linear time. arXiv:2203.00671 (2022)","DOI":"10.1109\/FOCS54457.2022.00064"},{"issue":"4","key":"2096_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02551274","volume":"2","author":"G Cybenko","year":"1989","unstructured":"Cybenko, G.: Approximation by superpositions of a sigmoidal function. Math. Control Signals Syst. 2(4), 303\u2013314 (1989)","journal-title":"Math. Control Signals Syst."},{"key":"2096_CR14","first-page":"1277","volume":"11","author":"EA Dinic","year":"1970","unstructured":"Dinic, E.A.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Doklady 11, 1277\u20131280 (1970)","journal-title":"Soviet Math. Doklady"},{"issue":"2","key":"2096_CR15","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"issue":"3","key":"2096_CR16","first-page":"149","volume":"3","author":"S Effati","year":"2008","unstructured":"Effati, S., Ranjbar, M.: Neural network models for solving the maximum flow problem. Appl. Appl. Math. 3(3), 149\u2013162 (2008)","journal-title":"Appl. Appl. Math."},{"key":"2096_CR17","unstructured":"Eldan, R., Shamir, O.: The power of depth for feedforward neural networks. In: Conference on Learning Theory, pp 907\u2013940 (2016)"},{"key":"2096_CR18","unstructured":"Emami, P., Ranka, S.: Learning permutations with sinkhorn policy gradient. arXiv:1805.07010 (2018)"},{"key":"2096_CR19","doi-asserted-by":"crossref","unstructured":"Erickson, J., Van Der\u00a0Hoog, I., Miltzow, T.: Smoothing the gap between NP and ER. SIAM Journal on Computing (2022)","DOI":"10.1137\/20M1385287"},{"issue":"1","key":"2096_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10208-014-9231-y","volume":"16","author":"S Fomin","year":"2016","unstructured":"Fomin, S., Grigoriev, D., Koshevoy, G.: Subtraction-free complexity, cluster transformations, and spanning trees. Found. Comput. Math. 16(1), 1\u201331 (2016)","journal-title":"Found. Comput. Math."},{"key":"2096_CR21","unstructured":"Froese, V., Hertrich, C.: Training neural networks is np-hard in fixed dimension. arXiv:2303.17045 (2023)"},{"key":"2096_CR22","doi-asserted-by":"crossref","unstructured":"Froese, V., Hertrich, C., Niedermeier, R.: The computational complexity of relu network training parameterized by data dimensionality. arXiv:2105.08675 (2021)","DOI":"10.1613\/jair.1.13547"},{"issue":"1","key":"2096_CR23","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1), 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"2096_CR24","unstructured":"Glorot, X., Bordes, A., Bengio, Y.: Deep sparse rectifier neural networks. In: 14th International conference on artificial intelligence and statistics, pp 315\u2013323 (2011)"},{"key":"2096_CR25","unstructured":"Goel, S., Klivans, A.R., Manurangsi, P., et\u00a0al.: Tight hardness results for training depth-2 ReLU networks. In: 12th Innovations in Theoretical Computer Science Conference (ITCS\u00a0\u201921) (2021)"},{"issue":"4","key":"2096_CR26","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM (JACM) 35(4), 921\u2013940 (1988)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"2096_CR27","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0304-3975(82)90092-5","volume":"21","author":"LM Goldschlager","year":"1982","unstructured":"Goldschlager, L.M., Shaw, R.A., Staples, J.: The maximum flow problem is log space complete for P. Theoret. Comput. Sci. 21(1), 105\u2013111 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"2096_CR28","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to parallel computation: P-completeness theory","author":"R Greenlaw","year":"1995","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to parallel computation: P-completeness theory. Oxford University Press, Oxford (1995)"},{"key":"2096_CR29","doi-asserted-by":"crossref","unstructured":"Haase, C.A., Hertrich, C., Loho, G.: Lower bounds on the depth of integral ReLU neural networks via lattice polytopes. In: International Conference on Learning Representations (ICLR) (2023)","DOI":"10.1137\/22M1489332"},{"issue":"10","key":"2096_CR30","doi-asserted-by":"publisher","first-page":"992","DOI":"10.3390\/math7100992","volume":"7","author":"B Hanin","year":"2019","unstructured":"Hanin, B.: Universal function approximation by deep neural nets with bounded width and ReLU activations. Mathematics 7(10), 992 (2019)","journal-title":"Mathematics"},{"key":"2096_CR31","unstructured":"Hanin, B., Rolnick, D.: Complexity of linear regions in deep networks. In: International Conference on Machine Learning (2019)"},{"key":"2096_CR32","unstructured":"Hanin, B., Sellke, M.: Approximating continuous functions by ReLU nets of minimal width. arXiv:1710.11278 (2017)"},{"key":"2096_CR33","doi-asserted-by":"crossref","unstructured":"Hartmanis, J., Simon, J.: On the power of multiplication in random access machines. In: 15th Annual Symposium on Switching and Automata Theory (SWAT 1974), IEEE, pp 13\u201323 (1974)","DOI":"10.1109\/SWAT.1974.20"},{"key":"2096_CR34","doi-asserted-by":"crossref","unstructured":"Hertrich, C., Sering, L.: ReLU neural networks of polynomial size for exact maximum flow computation. In: International Conference on Integer Programming and Combinatorial Optimization, Springer, pp 187\u2013202 (2023)","DOI":"10.1007\/978-3-031-32726-1_14"},{"key":"2096_CR35","doi-asserted-by":"crossref","unstructured":"Hertrich, C., Skutella, M.: Provably good solutions to the knapsack problem via neural networks of bounded size. AAAI Conference on Artificial Intelligence (2021)","DOI":"10.1609\/aaai.v35i9.16939"},{"key":"2096_CR36","first-page":"3336","volume":"34","author":"C Hertrich","year":"2021","unstructured":"Hertrich, C., Basu, A., Di Summa, M., et al.: Towards lower bounds on the depth of ReLU neural networks. Adv. Neural. Inf. Process. Syst. 34, 3336\u20133348 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"3","key":"2096_CR37","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield, J.J., Tank, D.W.: \u201cNeural\u2019\u2019 computation of decisions in optimization problems. Biol. Cybern. 52(3), 141\u2013152 (1985)","journal-title":"Biol. Cybern."},{"issue":"2","key":"2096_CR38","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0893-6080(91)90009-T","volume":"4","author":"K Hornik","year":"1991","unstructured":"Hornik, K.: Approximation capabilities of multilayer feedforward networks. Neural Netw. 4(2), 251\u2013257 (1991)","journal-title":"Neural Netw."},{"issue":"3","key":"2096_CR39","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1145\/322326.322341","volume":"29","author":"M Jerrum","year":"1982","unstructured":"Jerrum, M., Snir, M.: Some exact complexity results for straight-line computations over semirings. J. ACM (JACM) 29(3), 874\u2013897 (1982)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"2096_CR40","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/s00224-014-9574-4","volume":"57","author":"S Jukna","year":"2015","unstructured":"Jukna, S.: Lower bounds for tropical circuits and dynamic programs. Theory Comput. Syst. 57(1), 160\u2013194 (2015)","journal-title":"Theory Comput. Syst."},{"key":"2096_CR41","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ipl.2018.10.018","volume":"142","author":"S Jukna","year":"2019","unstructured":"Jukna, S., Seiwert, H.: Greedy can beat pure dynamic programming. Inf. Process. Lett. 142, 90\u201395 (2019)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"2096_CR42","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1109\/31.1783","volume":"35","author":"MP Kennedy","year":"1988","unstructured":"Kennedy, M.P., Chua, L.O.: Neural networks for nonlinear programming. IEEE Trans. Circuits Syst. 35(5), 554\u2013562 (1988)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"2096_CR43","doi-asserted-by":"crossref","unstructured":"Khalife, S., Basu, A.: Neural networks with linear threshold activations: structure and algorithms. In: International Conference on Integer Programming and Combinatorial Optimization, Springer, pp 347\u2013360 (2022)","DOI":"10.1007\/978-3-031-06901-7_26"},{"key":"2096_CR44","unstructured":"Khalil, E., Dai, H., Zhang, Y., et\u00a0al.: Learning combinatorial optimization algorithms over graphs. Advances in neural information processing systems 30 (2017)"},{"key":"2096_CR45","unstructured":"Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: International Conference on Learning Representations (2019)"},{"key":"2096_CR46","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2008","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer, Berlin (2008)","edition":"4"},{"key":"2096_CR47","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521, 436\u2013444 (2015)","journal-title":"Nature"},{"key":"2096_CR48","unstructured":"Liang, S., Srikant, R.: Why deep neural networks for function approximation? In: International Conference on Learning Representations (2017)"},{"issue":"2","key":"2096_CR49","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25(2), 207\u2013236 (2017)","journal-title":"TOP"},{"issue":"5","key":"2096_CR50","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1287\/opre.47.5.744","volume":"47","author":"ST McCormick","year":"1999","unstructured":"McCormick, S.T.: Fast algorithms for parametric scheduling come from extensions to parametric maximum flow. Oper. Res. 47(5), 744\u2013756 (1999)","journal-title":"Oper. Res."},{"key":"2096_CR51","unstructured":"Montufar, G.F., Pascanu, R., Cho, K., et al.: On the number of linear regions of deep neural networks. Adv. Neural Inf. Process. Syst. 27 (2014)"},{"key":"2096_CR52","unstructured":"Mukherjee, A., Basu, A.: Lower bounds over boolean inputs for deep neural networks with ReLU gates. arXiv:1711.03073 (2017)"},{"issue":"14","key":"2096_CR53","doi-asserted-by":"publisher","first-page":"3498","DOI":"10.1016\/j.cam.2012.03.001","volume":"236","author":"A Nazemi","year":"2012","unstructured":"Nazemi, A., Omidi, F.: A capable neural network model for solving the maximum flow problem. J. Comput. Appl. Math. 236(14), 3498\u20133513 (2012)","journal-title":"J. Comput. Appl. Math."},{"key":"2096_CR54","unstructured":"Nguyen, Q., Mukkamala, M.C., Hein, M.: Neural networks should be wide enough to learn disconnected decision regions. In: International Conference on Machine Learning (2018)"},{"key":"2096_CR55","doi-asserted-by":"crossref","unstructured":"Nowak, A., Villar, S., Bandeira, A.S., et\u00a0al.: Revised Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks. arXiv:1706.07450 (2017)","DOI":"10.1109\/DSW.2018.8439919"},{"key":"2096_CR56","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in O(nm) time, or better. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing (STOC \u201913). Association for Computing Machinery, pp 765\u2013774 (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"2096_CR57","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1836.001.0001","volume-title":"Circuit complexity and neural networks","author":"I Parberry","year":"1994","unstructured":"Parberry, I., Garey, M.R., Meyer, A.: Circuit complexity and neural networks. MIT Press, Cambridge (1994)"},{"key":"2096_CR58","unstructured":"Pascanu, R., Montufar, G., Bengio, Y.: On the number of inference regions of deep feed forward networks with piece-wise linear activations. In: International Conference on Learning Representations (2014)"},{"key":"2096_CR59","doi-asserted-by":"crossref","unstructured":"Pratt, V.R., Rabin, M.O., Stockmeyer, L.J.: A characterization of the power of vector machines. In: Proceedings of the sixth annual ACM Symposium on Theory of Computing (STOC), pp 122\u2013134 (1974)","DOI":"10.1145\/800119.803892"},{"key":"2096_CR60","unstructured":"Raghu, M., Poole, B., Kleinberg, J., et\u00a0al.: On the expressive power of deep neural networks. In: International Conference on Machine Learning (2017)"},{"issue":"6","key":"2096_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3127497","volume":"64","author":"T Rothvo\u00df","year":"2017","unstructured":"Rothvo\u00df, T.: The matching polytope has exponential extension complexity. J. ACM (JACM) 64(6), 1\u201319 (2017)","journal-title":"J. ACM (JACM)"},{"key":"2096_CR62","unstructured":"Safran, I., Shamir, O.: Depth-width tradeoffs in approximating natural functions with neural networks. In: International Conference on Machine Learning (2017)"},{"key":"2096_CR63","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage, A.: On the power of random access machines. In: International Colloquium on Automata, Languages, and Programming, Springer, pp 520\u2013529 (1979)","DOI":"10.1007\/3-540-09510-1_42"},{"key":"2096_CR64","unstructured":"Serra, T., Tjandraatmadja, C., Ramalingam, S.: Bounding and counting linear regions of deep neural networks. In: International Conference on Machine Learning (2018)"},{"key":"2096_CR65","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding machine learning: From theory to algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding machine learning: From theory to algorithms. Cambridge University Press, Cambridge (2014)"},{"key":"2096_CR66","unstructured":"Shamos, M.I.: Computational geometry. PhD thesis, Yale University (1979)"},{"issue":"6","key":"2096_CR67","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/S0893-6080(05)80093-0","volume":"5","author":"JS Shawe-Taylor","year":"1992","unstructured":"Shawe-Taylor, J.S., Anthony, M.H., Kern, W.: Classes of feedforward neural networks and their circuit complexity. Neural Netw. 5(6), 971\u2013977 (1992)","journal-title":"Neural Netw."},{"key":"2096_CR68","volume-title":"Arithmetic circuits: A survey of recent results and open questions","author":"A Shpilka","year":"2010","unstructured":"Shpilka, A., Yehudayoff, A.: Arithmetic circuits: A survey of recent results and open questions. Now Publishers Inc, USA (2010)"},{"issue":"1","key":"2096_CR69","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"KA Smith","year":"1999","unstructured":"Smith, K.A.: Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS J. Comput. 11(1), 15\u201334 (1999)","journal-title":"INFORMS J. Comput."},{"key":"2096_CR70","unstructured":"Telgarsky, M.: Representation benefits of deep feedforward networks. arXiv:1509.08101 (2015)"},{"key":"2096_CR71","unstructured":"Telgarsky, M.: Benefits of depth in neural networks. In: Conference on Learning Theory, pp 1517\u20131539 (2016)"},{"key":"2096_CR72","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. Adv. Neural Inf. Process. Syst. 28 (2015)"},{"key":"2096_CR73","doi-asserted-by":"publisher","DOI":"10.1017\/9781316888568","volume-title":"Network Flow Algorithms","author":"DP Williamson","year":"2019","unstructured":"Williamson, D.P.: Network Flow Algorithms. Cambridge University Press, Cambridge (2019)"},{"key":"2096_CR74","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.neunet.2017.07.002","volume":"94","author":"D Yarotsky","year":"2017","unstructured":"Yarotsky, D.: Error bounds for approximations with deep relu networks. Neural Netw. 94, 103\u2013114 (2017)","journal-title":"Neural Netw."},{"issue":"3","key":"2096_CR75","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/3446776","volume":"64","author":"C Zhang","year":"2021","unstructured":"Zhang, C., Bengio, S., Hardt, M., et al.: Understanding deep learning (still) requires rethinking generalization. Commun. ACM 64(3), 107\u2013115 (2021)","journal-title":"Commun. ACM"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02096-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02096-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02096-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T15:49:49Z","timestamp":1740757789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02096-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,25]]},"references-count":75,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2096"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02096-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,25]]},"assertion":[{"value":"21 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they do not have further Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}