乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T19:54:58Z","timestamp":1721764498216},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":3643,"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,9]]},"DOI":"10.1016\/s0166-218x(02)00458-4","type":"journal-article","created":{"date-parts":[[2003,7,22]],"date-time":"2003-07-22T20:46:14Z","timestamp":1058906774000},"page":"311-322","source":"Crossref","is-referenced-by-count":62,"title":["A push-relabel framework for submodular function minimization and applications to parametric optimization"],"prefix":"10.1016","volume":"131","author":[{"given":"Lisa","family":"Fleischer","sequence":"first","affiliation":[]},{"given":"Satoru","family":"Iwata","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00458-4_BIB1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0095-8956(84)90023-6","article-title":"Testing membership in matroid polyhedra","volume":"36","author":"Cunningham","year":"1984","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(02)00458-4_BIB2","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)00458-4_BIB3","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","article-title":"On nonlinear fractional programming","volume":"13","author":"Dinkelbach","year":"1967","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(02)00458-4_BIB4","series-title":"Combinatorial Structures and their Applications","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/S0166-218X(02)00458-4_BIB5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s101070100253","article-title":"A faster capacity scaling algorithm for submodular flow","volume":"92","author":"Fleischer","year":"2002","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00458-4_BIB6","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1287\/moor.5.2.186","article-title":"Lexicographically optimal base of a polymatroid with respect to a weight vector","volume":"5","author":"Fujishige","year":"1980","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00458-4_BIB7","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF03167272","article-title":"New algorithms for the intersection problem of submodular systems","volume":"9","author":"Fujishige","year":"1992","journal-title":"Japan J. Ind. Appl. Math."},{"key":"10.1016\/S0166-218X(02)00458-4_BIB8","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","article-title":"A fast parametric maximum flow algorithm and applications","volume":"18","author":"Gallo","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00458-4_BIB9","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum flow problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(02)00458-4_BIB10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(02)00458-4_BIB11","series-title":"Geom. Algorithms and Combin. Optimization","doi-asserted-by":"crossref","author":"Gr\u00f6tschel","year":"1988","DOI":"10.1007\/978-3-642-97881-4"},{"key":"10.1016\/S0166-218X(02)00458-4_BIB12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF02614442","article-title":"A capacity scaling algorithm for convex cost submodular flows","volume":"76","author":"Iwata","year":"1997","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00458-4_BIB13","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/502090.502096","article-title":"A combinatorial strongly polynomial algorithm for minimizing submodular functions","volume":"48","author":"Iwata","year":"2001","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(02)00458-4_BIB14","doi-asserted-by":"crossref","unstructured":"S. Iwata, S.T. McCormick, M. Shigeno, A strongly polynomial cut canceling algorithm for the submodular flow problem, in: Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization (IPCO), Graz, Austria, 1999, pp. 259\u2013272.","DOI":"10.1007\/3-540-48777-8_20"},{"key":"10.1016\/S0166-218X(02)00458-4_BIB15","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/moor.22.4.803","article-title":"A fast parametric submodular intersection algorithm for strong map sequences","volume":"22","author":"Iwata","year":"1997","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00458-4_BIB16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01585506","article-title":"Optimal flows in networks with multiple sources and sinks","volume":"7","author":"Megiddo","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00458-4_BIB17","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1006\/jctb.2000.1989","article-title":"A combinatorial algorithm minimizing submodular functions in strongly polynomial time","volume":"80","author":"Schrijver","year":"2000","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(02)00458-4_BIB18","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1287\/moor.11.2.362","article-title":"Layered augmenting path algorithms","volume":"11","author":"Tardos","year":"1986","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00458-4_BIB19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1287\/opre.26.2.305","article-title":"Minimizing a submodular function on a lattice","volume":"26","author":"Topkis","year":"1978","journal-title":"Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004584?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004584?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T21:45:53Z","timestamp":1623188753000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02004584"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00458-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}