{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T08:37:58Z","timestamp":1712047078594},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,1,30]],"date-time":"2011-01-30T00:00:00Z","timestamp":1296345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s10107-010-0431-1","type":"journal-article","created":{"date-parts":[[2011,1,29]],"date-time":"2011-01-29T05:11:53Z","timestamp":1296277913000},"page":"323-348","source":"Crossref","is-referenced-by-count":7,"title":["Hyperbolic set covering problems with competing ground-set elements"],"prefix":"10.1007","volume":"134","author":[{"given":"Edoardo","family":"Amaldi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandro","family":"Bosio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Malucelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,30]]},"reference":[{"key":"431_CR1","doi-asserted-by":"crossref","unstructured":"Amaldi, E., Capone, A., Cesana, M., Malucelli, F.: Optimizing WLAN radio coverage. In: Proceedings of the 2004 IEEE International Conference on Communications, vol. 1, pp. 180\u2013184 (2004)","DOI":"10.1109\/ICC.2004.1312476"},{"issue":"4","key":"431_CR2","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"Balas E., Padberg M.W.: Set partitioning: A survey. SIAM Rev. 18(4), 710\u2013760 (1976)","journal-title":"SIAM Rev."},{"key":"431_CR3","doi-asserted-by":"crossref","unstructured":"Bazaraa, M.S.: A cutting-plane algorithm for the quadratic set-covering problem. Oper. Res. 23(1) (1975)","DOI":"10.1287\/opre.23.1.150"},{"issue":"11","key":"431_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"431_CR5","doi-asserted-by":"crossref","unstructured":"Berman, P., DasGupta, B., Sontag, E.D.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. In: APPROX: international workshop on approximation algorithms for combinatorial optimization (2004)","DOI":"10.1007\/978-3-540-27821-4_4"},{"key":"431_CR6","unstructured":"Bosio, S.: Instance library for the hyperbolic set covering problem. Available online at http:\/\/orgroup.dei.polimi.it\/people\/bosio\/Instances.zip"},{"key":"431_CR7","unstructured":"Bosio, S.: On a new class of set covering problems arising in wireless network design. Ph.D. thesis, Dipartimento di Matematica, Politecnico di Milano, April (2006). Available online at http:\/\/orgroup.dei.polimi.it\/people\/bosio\/publications\/PhD.pdf"},{"issue":"6","key":"431_CR8","doi-asserted-by":"crossref","first-page":"1414","DOI":"10.1109\/TNET.2007.896478","volume":"15","author":"S. Bosio","year":"2007","unstructured":"Bosio S., Capone A., Cesana M.: Radio planning of wireless local area networks. IEEE\/ACM Trans. Netw. 15(6), 1414\u20131427 (2007)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"431_CR9","volume-title":"Annotated bibliographies in combinatorial optimization","author":"S. Ceria","year":"1997","unstructured":"Ceria S., Nobili P., Sassano A.: Set covering problem. In: Dell\u2019Amico, M., Maffioli, F., Martello, S. (eds) Annotated bibliographies in combinatorial optimization, Wiley, New York (1997)"},{"key":"431_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal V.: A greedy heuristic for the set covering problem. Math. Oper. Res. 4, 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"431_CR11","doi-asserted-by":"crossref","unstructured":"Cornuejols, G.: Combinatorial optimization: packing and covering. Number 74 in CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM (2001)","DOI":"10.1137\/1.9780898717105"},{"key":"431_CR12","doi-asserted-by":"crossref","unstructured":"Engebretsen, L., Holmerin, J.: Clique is hard to approximate within n 1\u2212o(1). In: Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), Lecture Notes in Computer Science, July 2000","DOI":"10.1007\/3-540-45022-X_2"},{"key":"431_CR13","unstructured":"Escoffier, B., Hammer, P.L.: Approximation of the quadratic set covering problem. Technical report 2005\u201309, DIMACS (2005)"},{"key":"431_CR14","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige U.: A threshold of ln(n) for approximating set cover. J. ACM 45, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"431_CR15","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler R.J., Paterson M.S., Tanimoto S.L.: Optimal packing and covering in the plane are NP- complete. Inf. Process. Lett. 12, 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"key":"431_CR16","unstructured":"Frangioni, A.: Object bundle package\u2014an OOP version of a proximal bundle algorithm for linearly constrained nondifferentiable convex optimization. Available online at http:\/\/www.di.unipi.it\/~frangio (2005)"},{"key":"431_CR17","volume-title":"Computers and Intractability. A Guide to the Theory of NP- Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability. A Guide to the Theory of NP- Completeness. W.H. Freeman and Co, New York (1979)"},{"key":"431_CR18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(86)90016-8","volume":"15","author":"N.G. Hall","year":"1986","unstructured":"Hall N.G., Hochbaum D.S.: A fast approximation algorithm for the multicovering problem. Discrete Appl. Math. 15, 35\u201340 (1986)","journal-title":"Discrete Appl. Math."},{"key":"431_CR19","unstructured":"Hammer, P.L.: Logical analysis of data: from combinatorial optimization to biomedical, financial and management applications. In: Fifth International Colloquium on Graphs and Optimisation (GO-V), 2006 (personal communication)"},{"key":"431_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean Methods in Operations Research and Related Areas","author":"P.L. Hammer","year":"1968","unstructured":"Hammer P.L., Rudeanu S.: Boolean Methods in Operations Research and Related Areas. Springer, Dordrecht (1968)"},{"key":"431_CR21","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01531072","volume":"1","author":"P. Hansen","year":"1990","unstructured":"Hansen P., Poggi de Arag\u00e3o M., Ribeiro C.: Boolean query optimization and the 0-1 hyperbolic sum problem. Ann. Math. Artif. Intell. 1, 97\u2013109 (1990)","journal-title":"Ann. Math. Artif. Intell."},{"key":"431_CR22","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01582890","volume":"52","author":"P. Hansen","year":"1991","unstructured":"Hansen P., Poggi de Arag\u00e3o M., Ribeiro C.: Hyperbolic 0-1 programming and query optimization in information retrieval. Math. Program. 52, 255\u2013263 (1991)","journal-title":"Math. Program."},{"key":"431_CR23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad J.: Clique is hard to approximate within n 1\u2212\u03b5 . Acta Math. 182, 105\u2013142 (1999)","journal-title":"Acta Math."},{"key":"431_CR24","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1109\/35.965365","volume":"39","author":"A. Hills","year":"2001","unstructured":"Hills A.: Large-scale wireless LAN design. IEEE Commun. Mag. 39, 98\u2013107 (2001)","journal-title":"IEEE Commun. Mag."},{"key":"431_CR25","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum D., Maass W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"431_CR26","doi-asserted-by":"crossref","unstructured":"Israeli, Y., Ceder,A.: Transit route design using scheduling and multiobjective programming techniques. In: Proceedings of the Sixth International Workshop on Computer-Aided Scheduling of Public Transport, vol. 430 Lecture Notes in Economics and Mathematical Systems, pp. 56\u201375 (1995)","DOI":"10.1007\/978-3-642-57762-8_5"},{"key":"431_CR27","volume-title":"Nonlinear Programming: Theory, Algorithms and Applications","author":"G.P. Mc Cormick","year":"1982","unstructured":"Mc Cormick G.P.: Nonlinear Programming: Theory, Algorithms and Applications. Wiley, New York (1982)"},{"key":"431_CR28","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"3","key":"431_CR29","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.orl.2004.05.011","volume":"33","author":"O.A. Prokopyev","year":"2005","unstructured":"Prokopyev O.A., Huang H., Pardalos P.M.: On complexity of unconstrained hyperbolic 0-1 programming problems. Oper. Res. Lett. 33(3), 312\u2013318 (2005)","journal-title":"Oper. Res. Lett."},{"key":"431_CR30","first-page":"25","volume":"1","author":"D. Schilling","year":"1993","unstructured":"Schilling D., Jayaraman V., Barkhi R.: A review of covering problems in facility location. Locat. Sci. 1, 25\u201355 (1993)","journal-title":"Locat. Sci."},{"key":"431_CR31","volume-title":"Combinatorial Optimization, Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"431_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-0035-6","volume-title":"Fractional Programming","author":"I.M. Stancu-Minasian","year":"1997","unstructured":"Stancu-Minasian I.M.: Fractional Programming. Kluwer, Dordrecht (1997)"},{"key":"431_CR33","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1023\/A:1021279918708","volume":"24","author":"M. Tawarmalani","year":"2002","unstructured":"Tawarmalani M., Ahmed S., Sahinidis N.V.: Global optimization of 0-1 hyperbolic programs. J. Glob. Optim. 24, 385\u2013416 (2002)","journal-title":"J. Glob. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0431-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0431-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0431-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T06:13:16Z","timestamp":1559974396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0431-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,30]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["431"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0431-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,30]]}}}