{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:24:45Z","timestamp":1649118285609},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T00:00:00Z","timestamp":1417478400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10878-014-9816-z","type":"journal-article","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T17:28:25Z","timestamp":1417541305000},"page":"1160-1173","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing some constructions with bars: new geometric knapsack problems"],"prefix":"10.1007","volume":"31","author":[{"given":"S.","family":"Bereg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. M.","family":"D\u00edaz-B\u00e1\u00f1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Flores-Pe\u00f1aloza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"P\u00e9rez-Lantero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Urrutia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,2]]},"reference":[{"issue":"1","key":"9816_CR1","first-page":"441","volume":"39","author":"D Angell","year":"2003","unstructured":"Angell D (2003) Rearrangement inequalities. Parabola 39(1):441","journal-title":"Parabola"},{"key":"9816_CR2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF01769706","volume":"10","author":"EM Arkin","year":"1993","unstructured":"Arkin EM, Khuller S, Mitchell JSB (1993) Geometric knapsack problems. Algorithimica 10:399\u2013427","journal-title":"Algorithimica"},{"key":"9816_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or M (1983) Lower bounds for algebraic computation trees. In: Proceedings of the 15th annual ACM symposium on theory of computing, STOC \u201983, pp. 80\u201386, New York, NY, USA, 1983. ACM","DOI":"10.1145\/800061.808735"},{"issue":"3","key":"9816_CR4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.comgeo.2007.10.001","volume":"40","author":"S Cabello","year":"2008","unstructured":"Cabello S, D\u00edaz-B\u00e1\u00f1ez JM, Seara C, Sellares JA, Urrutia J, Ventura I (2008) Covering point sets with two disjoint disks or squares. Comput Geom 40(3):195\u2013206","journal-title":"Comput Geom"},{"issue":"1","key":"9816_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01942293","volume":"32","author":"R Church","year":"1974","unstructured":"Church R, Velle CR (1974) The maximal covering location problem. Papers Reg Sci 32(1):101\u2013118","journal-title":"Papers Reg Sci"},{"issue":"2","key":"9816_CR6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1111\/j.1467-9787.1984.tb01031.x","volume":"24","author":"RL Church","year":"1984","unstructured":"Church RL (1984) The planar maximal covering location problem. Journal of Regional Science 24(2):185\u2013201","journal-title":"Journal of Regional Science"},{"issue":"1","key":"9816_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0925-7721(98)00015-7","volume":"11","author":"M Dickerson","year":"1998","unstructured":"Dickerson M, Scharstein D (1998) Optimal placement of convex polygons to maximize point containment. Comput Geom 11(1):1\u201316","journal-title":"Comput Geom"},{"key":"9816_CR8","volume-title":"Facility location: applications and theory","author":"Z Drezner","year":"2004","unstructured":"Drezner Z, Hamacher HW (2004) Facility location: applications and theory. Springer, Berlin"},{"key":"9816_CR9","unstructured":"Drezner Z, Wesolowsky GO (1994) Finding the circle or rectangle containing the minimum weight of points. Locat Sci 2:83\u201390"},{"key":"9816_CR10","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, Chichester"},{"key":"9816_CR11","volume-title":"Continuous covering location problems. Facility location: applications and theory","author":"F Plastria","year":"2002","unstructured":"Plastria F (2002) Continuous covering location problems. Facility location: applications and theory, vol 1. Springer, Berlin"},{"issue":"2","key":"9816_CR12","first-page":"164","volume":"12","author":"A Wayne","year":"1946","unstructured":"Wayne A (1946) Inequalities and inversions of order. Scr Math 12(2):164\u2013169","journal-title":"Scr Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9816-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9816-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9816-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:25Z","timestamp":1559276605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9816-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,2]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9816"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9816-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,2]]}}}