{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:07:27Z","timestamp":1649074047169},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1007\/bf01423649","type":"journal-article","created":{"date-parts":[[2005,4,11]],"date-time":"2005-04-11T23:41:19Z","timestamp":1113262879000},"page":"181-192","source":"Crossref","is-referenced-by-count":0,"title":["Absolute bounds on optimal cost for a class of set covering problems"],"prefix":"10.1007","volume":"33","author":[{"given":"N. G.","family":"Hall","sequence":"first","affiliation":[]},{"given":"R. V.","family":"Vohra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"Balas E (1981) A class of location, distribution and scheduling problems modeling and solution methods. Paper presented at the Chinese-American Symposium on Systems Analysis and Engineering, Xian"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","volume":"12","author":"E Balas","year":"1980","unstructured":"Balas E, Ho A (1980) Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Mathematical Programming Study 12:37?60","journal-title":"Mathematical Programming Study"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/opre.29.3.501","volume":"29","author":"JJ Bartholdi","year":"1981","unstructured":"Bartholdi JJ (1981) A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Operations Research 29:501?510","journal-title":"Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal V (1979) A greedy heuristic for the set covering problem. Mathematics of Operations Research 4:233?235","journal-title":"Mathematics of Operations Research"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Clapham CRJ (1973) Introduction to mathematical analysis. Routledge & Kegan Paul","DOI":"10.1007\/978-94-011-6572-3"},{"key":"CR6","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability; a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"CR7","first-page":"189","volume":"25","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS (1985) Easy solutions for the k-center problem or the dominating set problem on random graphs. Annals of Discrete Mathematics 25:189?210","journal-title":"Annals of Discrete Mathematics"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson DS (1974) Approximation algorithms for combinatorial problems. J Computer & Systems Sciences 9:256?278","journal-title":"J Computer & Systems Sciences"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lovasz","year":"1975","unstructured":"Lovasz L (1975) On the ratio of optimal integral and fractional covers. Discrete Mathematics 13:383?390","journal-title":"Discrete Mathematics"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1287\/trsc.7.1.34","volume":"7","author":"J Rubin","year":"1973","unstructured":"Rubin J (1973) A technique for the solution of massive set covering problems with applications to airline crew scheduling. Transportation Science 7:34?48","journal-title":"Transportation Science"}],"container-title":["ZOR Zeitschrift f\ufffdr Operations Research Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01423649.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01423649\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01423649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T10:06:48Z","timestamp":1556878008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01423649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["BF01423649"],"URL":"https:\/\/doi.org\/10.1007\/bf01423649","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}