{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:26:18Z","timestamp":1751880378081,"version":"3.41.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1023\/a:1009877408258","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:53:29Z","timestamp":1040601209000},"page":"115-126","source":"Crossref","is-referenced-by-count":6,"title":["Inverse Polymatroidal Flow Problem"],"prefix":"10.1007","volume":"3","author":[{"given":"Mao-Cheng","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoguang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanjun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"211424_CR1","volume-title":"On the inverse shortest path problem","author":"D. Burton","year":"1992","unstructured":"D. Burton, \"On the inverse shortest path problem,\" Ph.D. Thesis, Facultes Universitaires Notre-Dame de la Paix de Numur, Department de Mathematique, Namur, Belgium, 1992"},{"key":"211424_CR2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D. Burton","year":"1992","unstructured":"D. Burton and Ph.L. Toint, \"On an instance of the inverse shortest paths problem,\" Math. Prog., vol. 53, pp. 45-61, 1992.","journal-title":"Math. Prog."},{"key":"211424_CR3","unstructured":"M. Cai, \"An inverse problem of matroid intersection,\" J. Comb. Optim., to appear."},{"key":"211424_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01193863","volume":"45","author":"M. Cai","year":"1997","unstructured":"M. Cai and Y. Li, \"Inverse matroid intersection problems,\" ZOR-Mathematical Methods of Operations Research, vol. 45, pp. 235-243, 1997.","journal-title":"ZOR-Mathematical Methods of Operations Research"},{"key":"211424_CR5","unstructured":"M. Cai and X. Yang, \"Inverse shortest path problems,\" in Proc. Internat. Symposium on Operations Research with Applications in Technology and Management (ISORA'95, Beijing), 1995, pp. 242-248."},{"key":"211424_CR6","unstructured":"M. Cai, X. Yang, and Y. Li, \"Inverse problems of submodular functions on digraphs,\" Journal of Optimization Theory and Applications, to appear."},{"key":"211424_CR7","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0191-2615(85)90003-7","volume":"19","author":"S.M. Easa","year":"1985","unstructured":"S.M. Easa, \"Shortest route with movement prohibition,\" Transportation Research B, vol. 19, pp. 197-208, 1985.","journal-title":"Transportation Research B"},{"key":"211424_CR8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"J. Edmonds and R. Giles, \"A min-max relation for submodular functions on graphs,\" Annals of Discrete Mathematics, vol. 1, pp. 185-204, 1977.","journal-title":"Annals of Discrete Mathematics"},{"key":"211424_CR9","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton University Press: Princeton, 1962."},{"key":"211424_CR10","first-page":"97","volume":"16","author":"A. Frank","year":"1982","unstructured":"A. Frank, \"An algorithm for submodular functions on graphs,\" Annals of Discrete Mathematics, vol. 16, pp. 97-120, 1982.","journal-title":"Annals of Discrete Mathematics"},{"key":"211424_CR11","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00a8otschel","year":"1988","unstructured":"M. Gr\u00a8otschel, L. Lov\u00b4asz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag: Berlin, Heidelberg, 1988, pp. 26-29."},{"key":"211424_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230120102","volume":"12","author":"R. Hassin","year":"1982","unstructured":"R. Hassin, \"Minimum cost flow with set-constraints,\" Networks, vol. 12, pp. 1-21, 1982.","journal-title":"Networks"},{"key":"211424_CR13","unstructured":"Z. Hu and Z. Liu, \"A strongly polynomial algorithm for the inverse shortest arborescence problem,\" European J. Operations Research, to appear."},{"key":"211424_CR14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(97)86750-9","volume":"82","author":"S. Huang","year":"1998","unstructured":"S. Huang and Z. Liu, \"On the inverse problem of k-matching of bipartite graph,\" Discrete Appl. Math., vol. 82, pp. 135-154, 1998.","journal-title":"Discrete Appl. Math."},{"key":"211424_CR15","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawler","year":"1976","unstructured":"E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston: New York, 1976."},{"key":"211424_CR16","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1287\/moor.7.3.334","volume":"7","author":"E. Lawler","year":"1982","unstructured":"E. Lawler and C.U. Martel, \"Computing maximal 'polymatroidal network flows',\" Mathematics of Operations Research, vol. 7, pp. 334-347, 1982.","journal-title":"Mathematics of Operations Research"},{"key":"211424_CR17","first-page":"45","volume-title":"Combinatorial Surveys; Proc. 6th British Combinatorial Conference","author":"L. Lov\u00b4asz","year":"1977","unstructured":"L. Lov\u00b4asz, \"Flats in matroids and geometric graphs,\" in Combinatorial Surveys; Proc. 6th British Combinatorial Conference, P.J. Cameron (Ed.), Academic Press: New York, 1977, pp. 45-86."},{"key":"211424_CR18","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical Programming-The State of the Art","author":"L. Lov\u00b4asz","year":"1983","unstructured":"L. Lov\u00b4asz, \"Submodular functions and convexity,\" in Mathematical Programming-The State of the Art, A. Bachen, M. Gr\u00a8otschel, and B. Korte (Eds.), Springer: Berlin, 1983, pp. 235-257."},{"key":"211424_CR19","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1190\/1.1442958","volume":"56","author":"T.J. Moser","year":"1991","unstructured":"T.J. Moser, \"Shortest path calculation of seismic rays,\" Geophysics, vol. 56, pp. 59-67, 1991.","journal-title":"Geophysics"},{"key":"211424_CR20","doi-asserted-by":"crossref","unstructured":"J.B. Orlin, \"A faster strongly polynomial minimum cost flow algorithm,\" in Proc. 20th ACM Symp. on the Theory of Comp., 1988, pp. 377-387.","DOI":"10.1145\/62212.62249"},{"key":"211424_CR21","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/B978-0-12-566780-7.50025-8","volume-title":"Progress in Combinatorial Optimization","author":"A. Schrijver","year":"1984","unstructured":"A. Schrijver, \"Total dual integrality from directed graphs, crossing families, and sub-and supermodular functions,\" in Progress in Combinatorial Optimization, W.R. Pulleyblank (Ed.), Academic Press: Toronto, 1984, pp. 315-361."},{"key":"211424_CR22","unstructured":"P.T. Sokkalingam, R.K. Ahuja, and J.B. Orlin, \"Inverse spanning tree problems: Formulations and algorithms,\" WP#3890-96, MIT Sloan School of Management, 1996."},{"key":"211424_CR23","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"\u00b4. E. Tardos","year":"1985","unstructured":"\u00b4 E. Tardos, \"A strongly polynomial minimum cost circulation algorithm,\" Combinatorica, vol. 5, pp. 247-255, 1985.","journal-title":"Combinatorica"},{"key":"211424_CR24","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"\u00b4. E. Tardos","year":"1986","unstructured":"\u00b4 E. Tardos, \"A strongly polynomial algorithm to solve combinatorial linear programs,\" Operations Research, vol. 34, pp. 250-256, 1986.","journal-title":"Operations Research"},{"key":"211424_CR25","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03167381","volume":"12","author":"S. Xu","year":"1995","unstructured":"S. Xu and J. Zhang, \"An inverse problem of the weighted shortest path problem,\" Japan J. Indust. Appl. Math., vol. 12, pp. 47-59, 1995.","journal-title":"Japan J. Indust. Appl. Math."},{"key":"211424_CR26","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/02331939708844306","volume":"40","author":"C. Yang","year":"1997","unstructured":"C. Yang and J. Zhang, \"Inverse maximum flow and minimum cut problems,\" Optimization, vol. 40, pp. 147-170, 1997.","journal-title":"Optimization"},{"key":"211424_CR27","volume-title":"Some inverse problems in combinatorial optimization","author":"C. Yang","year":"1988","unstructured":"C. Yang, \"Some inverse problems in combinatorial optimization,\" Ph.D. Thesis, Department of Mathematics, City University of Hong Kong, 1988."},{"key":"211424_CR28","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0377-0427(95)00277-4","volume":"72","author":"J. Zhang","year":"1996","unstructured":"J. Zhang and Z. Liu, \"Calculating some inverse linear programming problems,\" J. Comp. & Appl. Math., vol. 72, pp. 261-273, 1996.","journal-title":"J. Comp. & Appl. Math."},{"key":"211424_CR29","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01194328","volume":"44","author":"J. Zhang","year":"1996","unstructured":"J. Zhang, Z. Liu, and Z. Ma, \"On the inverse problem of minimum spanning tree with partition constraints,\" ZOR-Mathematical Methods of Operations Research, vol. 44, pp. 171-187, 1996.","journal-title":"ZOR-Mathematical Methods of Operations Research"},{"key":"211424_CR30","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/02331939608844197","volume":"37","author":"J. Zhang","year":"1996","unstructured":"J. Zhang and Z. Ma, \"A network flow method for solving some inverse combinatorial optimization problems,\" Optimization, vol. 37, pp. 59-72, 1996.","journal-title":"Optimization"},{"key":"211424_CR31","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01432364","volume":"41","author":"J. Zhang","year":"1995","unstructured":"J. Zhang, Z. Ma, and C. Yang, \"A column generation method for inverse shortest path problems,\" ZOR-Mathematical Methods of Operations Research, vol. 41, pp. 347-358, 1995.","journal-title":"ZOR-Mathematical Methods of Operations Research"},{"key":"211424_CR32","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1080\/10556789708805666","volume":"8","author":"J. Zhang","year":"1997","unstructured":"J. Zhang, S. Xu, and Z. Ma, \"An algorithm for inverse minimum spanning tree problem,\" Optimization Methods and Software, vol. 8, pp. 69-84, 1997.","journal-title":"Optimization Methods and Software"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009877408258.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009877408258\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009877408258.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:14:52Z","timestamp":1751282092000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009877408258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["211424"],"URL":"https:\/\/doi.org\/10.1023\/a:1009877408258","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}