{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T10:39:56Z","timestamp":1760438396829},"reference-count":24,"publisher":"Elsevier BV","issue":"4-5","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0167-6377(98)00017-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:37:06Z","timestamp":1027611426000},"page":"137-143","source":"Crossref","is-referenced-by-count":12,"title":["A fast bipartite network flow algorithm for selective assembly"],"prefix":"10.1016","volume":"22","author":[{"given":"Satoru","family":"Iwata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomomi","family":"Matsui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.Thomas","family":"McCormick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00017-0_BIB1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(93)90220-I","article-title":"Monge and feasibility sequences in general flow problems,","volume":"44","author":"Adler","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB2","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, A. Bar-Noy, S. Khuller, D. Kravets, B. Schieber, Efficient minimum cost matching using quadrangle inequality, Proc. 33rd Annual Symp. on Foundations of Computer Science, IEEE, New York, 1992, pp. 583\u2013592.","DOI":"10.1109\/SFCS.1992.267793"},{"key":"10.1016\/S0167-6377(98)00017-0_BIB3","unstructured":"R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, New York."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB4","unstructured":"K.L. Booth, PQ tree algorithms, Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, University of California, Berkeley, CA, 1975."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB5","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0166-218X(95)00103-X","article-title":"Perspective of Monge properties in optimization,","volume":"70","author":"Burkard","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0377-2217(94)90208-9","article-title":"Scheduling jobs to minimize total cost,","volume":"74","author":"Chen","year":"1994","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB8","doi-asserted-by":"crossref","unstructured":"C.R. Coullard, A.B. Gamble, P.C. Jones, Matching problems in selective assembly operations, Ann. Oper. Res., 76 (1998) 95\u2013107.","DOI":"10.1023\/A:1018960924601"},{"key":"10.1016\/S0167-6377(98)00017-0_BIB9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0024-3795(90)90393-Q","article-title":"Monge sequences, antimatroids, and the transportation problem with forbidden arcs","volume":"139","author":"Dietrich","year":"1990","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union,","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0167-6377(84)90068-3","article-title":"AnO(nlogn) algorithm for the convex bipartite matching problem","volume":"3","author":"Gallo","year":"1984","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB12","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB13","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/nav.3800140304","article-title":"Maximum matching in a convex bipartite graph","volume":"14","author":"Glover","year":"1976","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB14","doi-asserted-by":"crossref","unstructured":"A.J. Hoffman, On simple linear programming problems, in: V. Klee (Ed.), Convexity: Proc. Symposia in Pure and Applied Mathematics, vol. 7, AMS, Providence, RI, 1963, pp. 317\u2013327.","DOI":"10.1090\/pspum\/007\/0157778"},{"key":"10.1016\/S0167-6377(98)00017-0_BIB15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/nav.3800210113","article-title":"Some simple scheduling algorithms,","volume":"21","author":"Horn","year":"1974","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB16","unstructured":"E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB17","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinooy Kan, P. Zipkin (Eds.), Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, vol. 4, North-Holland, Amsterdam, 1993, pp. 445\u2013522.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"10.1016\/S0167-6377(98)00017-0_BIB18","doi-asserted-by":"crossref","unstructured":"W. Lipski, Jr., F.P. Preparata, Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems, Acta Inform. 15 (1981) 329\u2013346.","DOI":"10.1007\/BF00264533"},{"key":"10.1016\/S0167-6377(98)00017-0_BIB19","doi-asserted-by":"crossref","unstructured":"S.T. McCormick, Fast algorithms for parametric scheduling come from extensions to parametric maximum flow, Proc. 28th ACM Symp. on the Theory of Computing, 1996, pp. 319\u2013328; Oper. Res., to appear.","DOI":"10.1145\/237814.237978"},{"key":"10.1016\/S0167-6377(98)00017-0_BIB20","doi-asserted-by":"crossref","unstructured":"T. Radzik, Newton\u2019s method for fractional combinatorial optimization, Proc. 33rd IEEE Ann. Symp. on the Foundations of Computer Science, 1992, pp. 659\u2013 669.","DOI":"10.21236\/ADA323687"},{"key":"10.1016\/S0167-6377(98)00017-0_BIB21","doi-asserted-by":"crossref","unstructured":"T. Radzik, Parametric flows, weighted means of cuts, and fractional combinatorial optimization, in: P. Pardalos (Ed.), Complexity in Numerical Optimization, World Scientific, Singapore, 1993, pp. 351\u2013386.","DOI":"10.1142\/9789814354363_0016"},{"key":"10.1016\/S0167-6377(98)00017-0_BIB22","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1287\/opre.44.4.617","article-title":"Scheduling jobs on several machines with the job splitting property","volume":"44","author":"Serafini","year":"1996","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB23","unstructured":"R. Shamir, B. Dietrich, Characterization and algorithms for greedily solvable transportation problems, Proc. 1st ACM\/SIAM Ann. Symp. on Discrete Algorithms, 1990, pp. 358\u2013366."},{"key":"10.1016\/S0167-6377(98)00017-0_BIB24","unstructured":"Y. Yamada, T. Kobayashi, Combinatorial optimization for selective assembly, Comm. Oper. Res. Soc. Japan 39 (1994) 556\u2013560 (in Japanese)."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000170?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000170?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T01:27:16Z","timestamp":1556328436000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":24,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0167637798000170"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00017-0","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}