{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:57:22Z","timestamp":1757627842719,"version":"3.44.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,5,20]],"date-time":"2003-05-20T00:00:00Z","timestamp":1053388800000},"content-version":"vor","delay-in-days":3245,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1016\/0305-0548(94)90083-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"689-705","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems"],"prefix":"10.1016","volume":"21","author":[{"given":"F.","family":"Harche","sequence":"first","affiliation":[]},{"given":"G.L.","family":"Thompson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"unstructured":"E. Balas, A class of location, distribution and scheduling problems: modelling and solution methods. Paper presented at the Chinese-American Symp. on Systems Analysis and Engineering, Xian, China.","key":"10.1016\/0305-0548(94)90083-3_BIB1"},{"key":"10.1016\/0305-0548(94)90083-3_BIB2","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","article-title":"Set partitioning: a survey","volume":"18","author":"Balas","year":"1976","journal-title":"SIAM Rev."},{"key":"10.1016\/0305-0548(94)90083-3_BIB3","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1287\/opre.19.4.998","article-title":"Set covering by single branch enumeration with linear programming subproblems","volume":"19","author":"Lemke","year":"1971","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90083-3_BIB4","first-page":"336","article-title":"Set covering by an all-integer algorithm: computational experience","volume":"31","author":"Salkin","year":"1973","journal-title":"J. Assoc. Comp. Mach."},{"key":"10.1016\/0305-0548(94)90083-3_BIB5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","article-title":"Set covering algorithms using cutting planes, heuristics and subgradient optimization: a computational study","volume":"12","author":"Balas","year":"1980","journal-title":"Math. Program. Study"},{"key":"10.1016\/0305-0548(94)90083-3_BIB6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","article-title":"An algorithm for set covering problems","volume":"31","author":"Beasley","year":"1987","journal-title":"Europ. J. Op. Res."},{"key":"10.1016\/0305-0548(94)90083-3_BIB7","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/opre.25.5.760","article-title":"The set covering problem: a new implicit enumeration algorithm","volume":"25","author":"Etcheberry","year":"1977","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90083-3_BIB8","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","article-title":"Optimal solution of set covering\/partitioning problems using dual heuristics","volume":"36","author":"Fisher","year":"1990","journal-title":"Man. Sci."},{"year":"1983","author":"Hey","article-title":"Algorithm for set covering problem using graph theory","key":"10.1016\/0305-0548(94)90083-3_BIB9"},{"key":"10.1016\/0305-0548(94)90083-3_BIB10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BFb0120885","article-title":"Cutting planes from conditional bounds: a new approach to set covering","volume":"12","author":"Balas","year":"1980","journal-title":"Math. Program. Study"},{"key":"10.1016\/0305-0548(94)90083-3_BIB11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01582278","article-title":"On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}","volume":"43","author":"Balas","year":"1989","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(94)90083-3_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01589093","article-title":"On the set covering polytope: II. Lifting all the facets with coefficients in {0, 1, 2}","volume":"45","author":"Balas","year":"1989","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(94)90083-3_BIB13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01582277","article-title":"On the 0, 1 facets of the set covering polytope","volume":"43","author":"Cornuehols","year":"1989","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(94)90083-3_BIB14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01587087","article-title":"On the facial structure of the set covering polytope","volume":"44","author":"Sassano","year":"1989","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(94)90083-3_BIB15","first-page":"736","article-title":"Applications of combinatorial programming to a class of all zero-one integer programming problems","volume":"13","author":"Pierce","year":"1986","journal-title":"Man. Sci."},{"key":"10.1016\/0305-0548(94)90083-3_BIB16","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.13.4.517","article-title":"An additive algorithm for solving linear programs with zero-one variables","volume":"13","author":"Balas","year":"1965","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90083-3_BIB17","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1287\/opre.17.5.848","article-title":"The set partitioning problem: set covering with equality constraints","volume":"17","author":"Garfinkel","year":"1969","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90083-3_BIB18","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1287\/mnsc.19.5.528","article-title":"Improved combinatorial programming algorithms for a class of all zero-one integer programming problems","volume":"19","author":"Pierce","year":"1973","journal-title":"Man. Sci."},{"key":"10.1016\/0305-0548(94)90083-3_BIB19","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1287\/mnsc.20.5.774","article-title":"An algorithm for large set partitioning problems","volume":"20","author":"Marsten","year":"1974","journal-title":"Man. Sci."},{"key":"10.1016\/0305-0548(94)90083-3_BIB20","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/net.3230110208","article-title":"Exact solutions of crew scheduling problems using the set partitioning model: recent successful applications","volume":"11","author":"Marsten","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(94)90083-3_BIB21","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1287\/mnsc.21.5.591","article-title":"A computational survey of methods for the set covering problem","volume":"21","author":"Christofides","year":"1975","journal-title":"Man. Sci."},{"key":"10.1016\/0305-0548(94)90083-3_BIB22","series-title":"Perspectives on Optimization","first-page":"164","article-title":"Optimal set covering: a survey","author":"Garfinkel","year":"1972"},{"key":"10.1016\/0305-0548(94)90083-3_BIB23","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1287\/opre.20.6.1152","article-title":"On the set covering problem","volume":"20","author":"Balas","year":"1972","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90083-3_BIB24","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/opre.23.1.74","article-title":"On the set covering problem, II. An algorithm for set partitioning","volume":"23","author":"Balas","year":"1975","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90083-3_BIB25","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02592222","article-title":"The pivot and probe algorithm for solving a linear program","volume":"29","author":"Sethi","year":"1984","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(94)90083-3_BIB26","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.16.2.422","article-title":"The multidimensional assignment problem","volume":"16","author":"Pierskalla","year":"1968","journal-title":"Ops Res."},{"doi-asserted-by":"crossref","unstructured":"E. Balas and M. J. Saltzman, An algorithm for the three-index assignment problem. Ops Res. 39 150\u2013161.","key":"10.1016\/0305-0548(94)90083-3_BIB27","DOI":"10.1287\/opre.39.1.150"},{"key":"10.1016\/0305-0548(94)90083-3_BIB28","first-page":"154","article-title":"Methoden zur Losung Driedimensionaler Zuordnungs-probleme","author":"Leue","year":"1972","journal-title":"Angew. Inf."},{"key":"10.1016\/0305-0548(94)90083-3_BIB29","first-page":"327","article-title":"A primal dual algorithm for the three-dimensional assignment problem","volume":"15","author":"Hansen","year":"1973","journal-title":"Cahiers de CERO"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900833?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900833?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:56:17Z","timestamp":1757480177000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0305054894900833"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90083-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[1994,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0305-0548(94)90083-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1994 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}