{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:46:08Z","timestamp":1767707168698},"reference-count":23,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1016\/s0305-0548(97)00008-7","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:18:15Z","timestamp":1049483895000},"page":"981-990","source":"Crossref","is-referenced-by-count":22,"title":["Maximal closure on a graph with resource constraints"],"prefix":"10.1016","volume":"24","author":[{"given":"Beyime","family":"Tachefine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Soumis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"633","key":"10.1016\/S0305-0548(97)00008-7_BIB1","first-page":"47","article-title":"Optimum design of open pit mines","volume":"68","author":"Lerchs","year":"1965","journal-title":"C.M.I. Bulletin"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/mnsc.17.3.200","article-title":"A selection problem of shared fixed costs and network flows","volume":"17","author":"Rhys","year":"1970","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB3","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1145\/321978.321982","article-title":"Mathematical techniques for efficient record segmentation in large shared databases","volume":"23","author":"Eisner","year":"1976","journal-title":"Journal of Associated Computing Machinery"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1287\/mnsc.12.7.485","article-title":"Capital budgeting of interrelated projects: survey and synthesis","volume":"12","author":"Weingartner","year":"1966","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB5","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.35.3.378","article-title":"Scheduling tasks with due dates in a fabrication\/assembly process","volume":"35","author":"Faaland","year":"1987","journal-title":"Operational Research"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB6","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1287\/mnsc.28.11.1328","article-title":"Optimizing field repair kits based on job completion rate","volume":"28","author":"Mamer","year":"1982","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB7","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 Journal on Computing"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB8","first-page":"394","article-title":"Selected applications of minimum cuts in networks","volume":"20","author":"Picard","year":"1982","journal-title":"INFOR"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0167-6377(86)90071-4","article-title":"An algorithm to generate the ideals of a partial order","volume":"5","author":"Steiner","year":"1986","journal-title":"Operational Research Letters"},{"issue":"11","key":"10.1016\/S0305-0548(97)00008-7_BIB10","doi-asserted-by":"crossref","DOI":"10.1287\/mnsc.22.11.1268","article-title":"Maximal closure of a graph and applications to combinatorial problem","volume":"22","author":"Picard","year":"1976","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/S0305-0548(97)00008-7_BIB11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1287\/mnsc.36.3.315","article-title":"A new algorithm for computing the maximal closure of a graph","volume":"36","author":"Faaland","year":"1990","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB12","series-title":"Proceedings of the 19th APCOM Symposium","first-page":"127","article-title":"Optimum open pit mine production scheduling by Lagrangian parameterization","author":"Dagdeleen","year":"1986"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB13","first-page":"176","article-title":"Optimum mine production sequencing using Lagrangian parameterization approach","volume":"2","author":"Zhao","year":"1993"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB14","first-page":"1","article-title":"Optimization procedures for open pit mine scheduling","volume":"1C","author":"Davis","year":"1973"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB15","series-title":"SME-AIME Meetings","first-page":"89","article-title":"Single time period production scheduling of open pit mines","author":"Eleveli","year":"1989"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB16","first-page":"703","article-title":"The cutting plane method for solving convex programs","volume":"8","author":"Kelley","year":"1960","journal-title":"SIAM Journal"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB17","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"The decomposition algorithm for linear programming","volume":"8","author":"Dantzig","year":"1960","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB18","author":"Hiriart-Urruty","year":"1993"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB19","article-title":"New variant of bundle methods and applications","author":"Lemarechal","year":"1991"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB20","first-page":"245","article-title":"On a bundle algorithm for nonsmooth optimization","volume":"Vol. 4","author":"Lemarechal","year":"1981"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB21","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB22","first-page":"434","article-title":"Determining the maximal flow in a network by the method of preflows","volume":"15","author":"Karzanov","year":"1074","journal-title":"Soviet Mathematics Doklady"},{"key":"10.1016\/S0305-0548(97)00008-7_BIB23","article-title":"\u00c9tude comparative des algorithmes de flot maximum pour le probl\u00e8me des contours finaux d'une mine \u00e0 ciel ouvert","volume":"G-96-30","author":"Tachefine","year":"1996","journal-title":"Cahiers du GERAD"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000087?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000087?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:21:22Z","timestamp":1555190482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054897000087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":23,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0305054897000087"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00008-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}