{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:10Z","timestamp":1759639090548},"reference-count":14,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0166-218x(02)00498-5","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"337-353","source":"Crossref","is-referenced-by-count":14,"title":["The base-matroid and inverse combinatorial optimization problems"],"prefix":"10.1016","volume":"128","author":[{"given":"Mauro","family":"Dell'Amico","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[]},{"given":"Federico","family":"Malucelli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00498-5_BIB1","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","article-title":"Inverse optimization","volume":"49","author":"Ahuja","year":"2001","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(02)00498-5_BIB2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1287\/opre.47.2.291","article-title":"Solving inverse spanning tree problems through network flow techniques","volume":"47","author":"Ahuja","year":"1999","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(02)00498-5_BIB3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","article-title":"On an instance of the inverse shortest path problem","volume":"53","author":"Burton","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00498-5_BIB4","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1023\/A:1009877408258","article-title":"Inverse problems of matroid intersection","volume":"3","author":"Cai","year":"1999","journal-title":"J. Combin. Optim."},{"key":"10.1016\/S0166-218X(02)00498-5_BIB5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01193863","article-title":"Inverse matroid intersection problem","volume":"45","author":"Cai","year":"1997","journal-title":"ZOR-Math. Methods Oper. Res."},{"key":"10.1016\/S0166-218X(02)00498-5_BIB6","first-page":"125","article-title":"Inverse polymatroid flow problem","volume":"3","author":"Cai","year":"1999","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0166-218X(02)00498-5_BIB7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF02579361","article-title":"On submodular function minimization","volume":"5","author":"Cunningham","year":"1985","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(02)00498-5_BIB8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.6028\/jres.069B.016","article-title":"Transversals and matroid partition","volume":"69B","author":"Edmons","year":"1965","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"10.1016\/S0166-218X(02)00498-5_BIB9","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","article-title":"A weighted matroid intersection algorithm","volume":"2","author":"Frank","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(02)00498-5_BIB10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(97)86750-9","article-title":"A strongly polynomial algorithm for the inverse shortest arborescence problem","volume":"82","author":"Hu","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00498-5_BIB11","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/S0166-218X(02)00498-5_BIB12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1190\/1.1442958","article-title":"Shortest paths calculation of seismic rays","volume":"56","author":"Moser","year":"1991","journal-title":"Geophysics"},{"key":"10.1016\/S0166-218X(02)00498-5_BIB13","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0166-218X(02)00498-5_BIB14","series-title":"Matroid Theory","author":"Oxley","year":"1992"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004985?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004985?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T05:58:06Z","timestamp":1553407086000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":14,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0166218X02004985"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00498-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}