{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T05:11:48Z","timestamp":1768972308038,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,11]],"date-time":"2010-05-11T00:00:00Z","timestamp":1273536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s10107-010-0366-6","type":"journal-article","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T10:31:32Z","timestamp":1273487492000},"page":"271-284","source":"Crossref","is-referenced-by-count":14,"title":["Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation"],"prefix":"10.1007","volume":"124","author":[{"given":"A. Ridha","family":"Mahjoub","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Thomas","family":"McCormick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,11]]},"reference":[{"issue":"1979","key":"366_CR1","first-page":"1","volume":"32","author":"U. Abel","year":"1978","unstructured":"Abel U., Carstens H.G., Deuber W., Pr\u00f6mel H.J.: Time Dependent and Hypergraphic Networks. Technical Report, Fakult\u00e4t f\u00fcr Mathematik, Universit\u00e4t Bielefeld. Part of this report appeared as: \u201cOn Hypergraphic Networks\u201d in Operations Research Verfahren 32(1979), 1\u20134 (1978)","journal-title":"Technical Report, Fakult\u00e4t f\u00fcr Mathematik, Universit\u00e4t Bielefeld. Part of this report appeared as: \u201cOn Hypergraphic Networks\u201d in Operations Research Verfahren"},{"key":"366_CR2","unstructured":"Baier, G.: Flows with Path Restrictions. Ph.D. thesis, TU Berlin (2003)"},{"key":"366_CR3","doi-asserted-by":"crossref","unstructured":"Baier, G., Erlebach, T., Hall, A., Kolman, P., K\u00f6hler, E., Pangrac, O., Schilling, H., Skutella, M.: Length-bounded cuts and flows. To appear in Transactions on Algorithms; an extended abstract appears in Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP\u201906), LNCS 4051, Springer, Berlin, pp. 679\u2013690 (2006)","DOI":"10.1007\/11786986_59"},{"key":"366_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/1097-0037(200008)36:1<17::AID-NET3>3.0.CO;2-Z","volume":"36","author":"W. Ben-Ameur","year":"2000","unstructured":"Ben-Ameur W.: Constrained length connectivity and survivable networks. Networks 36, 17\u201333 (2000)","journal-title":"Networks"},{"key":"366_CR5","unstructured":"Bley, A. (1997) Node-Disjoint Length-Restricted Paths. Master\u2019s thesis, TU Berlin"},{"key":"366_CR6","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s00037-003-0179-6","volume":"12","author":"A. Bley","year":"2003","unstructured":"Bley A.: On the complexity of vertex-disjoint length-restricted path problems. Comput. Complex. 12, 131\u2013149 (2003)","journal-title":"Comput. Complex."},{"key":"366_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/jgt.3190060215","volume":"6","author":"S.M. Boyles","year":"1982","unstructured":"Boyles S.M., Exoo G.: A counterexample to a conjecture on paths of bounded length. J. Graph Theory 6, 205\u2013209 (1982)","journal-title":"J. Graph Theory"},{"key":"366_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/978-1-4613-3629-7_2","volume-title":"Advances in Optimization and Approximation","author":"C.R. Coullard","year":"1994","unstructured":"Coullard C.R., Gamble A.B., Liu J.: The K-walk polyhedron. In: Du, D.-Z., Sun, J. (eds) Advances in Optimization and Approximation, pp. 9\u201329. Kluwer, Norwell (1994)"},{"key":"366_CR9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0167-6377(03)00026-9","volume":"32","author":"G. Dahl","year":"2004","unstructured":"Dahl G., Gouveia L.: On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32, 15\u201322 (2004)","journal-title":"Oper. Res. Lett."},{"key":"366_CR10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.orl.2003.10.008","volume":"32","author":"G. Dahl","year":"2004","unstructured":"Dahl G., Foldnes N., Gouveia L.: A note on hop-constrained walk polytopes. Oper. Res. Lett. 32, 345\u2013349 (2004)","journal-title":"Oper. Res. Lett."},{"key":"366_CR11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/opre.38.1.127","volume":"38","author":"R.K. Martin","year":"1990","unstructured":"Martin R.K., Rardin R.L., Campbell B.A.: Polyhedral characterization of discrete dynamic programming. Oper. Res. 38, 127\u2013138 (1990)","journal-title":"Oper. Res."},{"key":"366_CR12","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(83)90197-8","volume":"44","author":"G. Exoo","year":"1983","unstructured":"Exoo G.: On line disjoint paths of bounded length. Discret. Math. 44, 317\u2013318 (1983)","journal-title":"Discret. Math."},{"key":"366_CR13","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Skutella, M.: Quickest flows over time. SIAM J. Comput. 36, 1600\u20131630; an extended abstract appeared in IPCO 2002, LNCS 2337, Springer, pp. 36\u201353 (2007)","DOI":"10.1137\/S0097539703427215"},{"key":"366_CR14","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford Jr","year":"1956","unstructured":"Ford L.R. Jr, Fulkerson D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"366_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10107-005-0576-5","volume":"105","author":"B. Fortz","year":"2006","unstructured":"Fortz B., Mahjoub A.R., McCormick S.T., Pesneau P.: The 2-edge connected subgraph problem with bounded rings. Math. Prog. 105, 85\u2013111 (2006)","journal-title":"Math. Prog."},{"key":"366_CR16","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"366_CR17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.10069","volume":"41","author":"L. Gouveia","year":"2003","unstructured":"Gouveia L., Magnanti T.L.: Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41, 159\u2013173 (2003)","journal-title":"Networks"},{"key":"366_CR18","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1002\/net.20034","volume":"44","author":"L. Gouveia","year":"2004","unstructured":"Gouveia L., Magnanti T.L., Requejo C.: A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Networks 44, 254\u2013265 (2004)","journal-title":"Networks"},{"key":"366_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M., Lov\u00e1sz L., Schrijver A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)"},{"key":"366_CR20","unstructured":"Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: (2003) Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67, 473\u2013496; a preliminary version appeared in Proceedings of 31st STOC, pp. 19\u201328 (1999)"},{"key":"366_CR21","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/BF01580250","volume":"6","author":"A.J. Hoffman","year":"1974","unstructured":"Hoffman A.J.: A generalization of max flow-\u00a0min cut. Math. Prog. 6, 352\u2013359 (1974)","journal-title":"Math. Prog."},{"key":"366_CR22","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1002\/net.20146","volume":"49","author":"D. Huygens","year":"2007","unstructured":"Huygens D., Labb\u00e9 M., Mahjoub A.R., Pesneau P.: The two-edge hop-constrained network design problem: valid inequalities and branch-and-cut. Networks 49, 116\u2013133 (2007)","journal-title":"Networks"},{"key":"366_CR23","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.20147","volume":"49","author":"D. Huygens","year":"2007","unstructured":"Huygens D., Mahjoub A.R.: Integer programming formulations for the two 4-hop-constrained paths problem. Networks 49, 135\u2013144 (2007)","journal-title":"Networks"},{"key":"366_CR24","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/S0895480102419445","volume":"18","author":"D. Huygens","year":"2004","unstructured":"Huygens D., Mahjoub A.R., Pesneau P.: Two edge hop-constrained paths and polyhedra. SIAM J. Discret. Math. 18, 287\u2013312 (2004)","journal-title":"SIAM J. Discret. Math."},{"key":"366_CR25","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230120306","volume":"12","author":"A. Itai","year":"1982","unstructured":"Itai A., Perl Y., Shiloach Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12, 277\u2013286 (1982)","journal-title":"Networks"},{"key":"366_CR26","unstructured":"Kabadi, S.N., Kang, J., Chandrasekaran, R., Nair, K.P.K.: Hop Constrained Network Flows: Analysis and Synthesis. Technical report, University of New Brunswick (2004)"},{"key":"366_CR27","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02019432","volume":"9","author":"L. Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz L., Neumann-Lara V., Plummer M.: Mengerian theorems for paths of bounded length. Periodica Mathematica Hungarica 9, 269\u2013276 (1978)","journal-title":"Periodica Mathematica Hungarica"},{"key":"366_CR28","doi-asserted-by":"crossref","unstructured":"Martens, M., McCormick, S.T.: A Polynomial Algorithm for Weighted Abstract Flow. Working paper, Sauder School of Business, UBC; an extended abstract appears in Proceedings of IPCO 2008, pp. 97\u2013111 (2008)","DOI":"10.1007\/978-3-540-68891-4_7"},{"key":"366_CR29","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/S0012-365X(96)00194-X","volume":"165\/166","author":"J-F. Maurras","year":"1997","unstructured":"Maurras J-F., Vax\u00e8s Y.: Multicommodity netwok flow with jump constraints. Discret. Math. 165\/166, 481\u2013486 (1997)","journal-title":"Discret. Math."},{"key":"366_CR30","unstructured":"McCormick, S.T.: A Polynomial Algorithm for Abstract Maximum Flow. UBC Faculty of Commerce Working Paper 95-MSC-001. An extended abstract appears in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 490\u2013497 (1995)"},{"key":"366_CR31","unstructured":"McCormick, S.T.: The Complexity of Max Flow and Min Cut with Bounded Length Paths. Talk at 6th International Workshop on Combinatorial Optimization, Aussois (2002)"},{"key":"366_CR32","unstructured":"Pesneau, P.: Conception de R\u00e9seaux 2-Connexes avec Contraintes de Bornes. Ph.D. thesis, Universit\u00e9 Blaise Pascal, Clermont-Ferrand (in French) (2003)"},{"key":"366_CR33","volume-title":"On Hypergraphic Networks","author":"H.J. Pr\u00f6mel","year":"1978","unstructured":"Pr\u00f6mel H.J.: On Hypergraphic Networks. Universit\u00e4t Bielefeld, Diplomarbeit (1978)"},{"key":"366_CR34","doi-asserted-by":"crossref","unstructured":"Reiter, M.K., Stubblebine, S.G.: Path Independence for Authentication in Large-Scale Systems. AT&T Labs technical report (1996)","DOI":"10.1145\/266420.266435"},{"key":"366_CR35","unstructured":"Williamson, D.P.: Lecture Notes on Approximation Algorithms. IBM TJ Watson Research Center Technical Report RC 21409, Yorktown Heights (1998)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0366-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0366-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0366-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:08Z","timestamp":1559109008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0366-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,11]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["366"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0366-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,11]]}}}