{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:29:52Z","timestamp":1759667392736},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T00:00:00Z","timestamp":1473897600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s11590-016-1081-x","type":"journal-article","created":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T03:33:56Z","timestamp":1473910436000},"page":"1357-1370","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On a linearization technique for solving the quadratic set covering problem and variations"],"prefix":"10.1007","volume":"11","author":[{"given":"Pooja","family":"Pandey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,15]]},"reference":[{"key":"1081_CR1","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"WP Adams","year":"1986","unstructured":"Adams, W.P., Sherali, H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32, 1274\u20131290 (1986)","journal-title":"Manag. Sci."},{"key":"1081_CR2","first-page":"37","volume":"12","author":"E Balas","year":"1980","unstructured":"Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and sub-gradient optimization: a computational study. Math. Progr. 12, 37\u201360 (1980)","journal-title":"Math. Progr."},{"key":"1081_CR3","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.23.1.150","volume":"23","author":"MS Bazaraa","year":"1975","unstructured":"Bazaraa, M.S., Goode, J.J.: A cutting-plane algorithm for the quadratic set-covering problem. Oper. Res. 23, 150\u2013158 (1975)","journal-title":"Oper. Res."},{"key":"1081_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"37","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: A lagrangian heuristic for set-covering problems. Naval Res. Logist. 37, 151\u2013164 (1990)","journal-title":"Naval Res. Logist."},{"key":"1081_CR5","unstructured":"Bector C.R., Bhatt S.K.: A linearization technique for solving integral linear fractional program: Proc. fifth Manitoba Conference on Numerical Mathematics, pp. 221\u2013229 (1975)"},{"key":"1081_CR6","unstructured":"Custic A., Punnen A.P.: A characterization of linearizable instances of the quadratic minimum spanning tree problem. arXiv:1510.02197 (2015)"},{"key":"1081_CR7","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.disopt.2007.10.001","volume":"4","author":"B Escoffier","year":"2007","unstructured":"Escoffier, B., Hammer, P.L.: Approximation of the quadratic set covering problem. Discrete Optim. 4, 378\u2013386 (2007)","journal-title":"Discrete Optim."},{"key":"1081_CR8","volume-title":"Integer Programming","author":"RS Garfinkel","year":"1972","unstructured":"Garfinkel, R.S., Nemhauser, G.L.: Integer Programming. Wiley, New York (1972)"},{"key":"1081_CR9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0377-2217(96)00161-0","volume":"101","author":"T Grossman","year":"1997","unstructured":"Grossman, T., Wool, A.: Computational experience with approximation algorithms for the set covering problem. Eur. J. Oper. Res. 101, 81\u201392 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"1081_CR10","first-page":"9","volume":"4","author":"R Gupta","year":"2014","unstructured":"Gupta, R., Saxena, R.R.: Linearization technique for solving quadratic set packing and partitioning problems. Int. J. Math. Comput. Appl. Res. 4, 9\u201320 (2014)","journal-title":"Int. J. Math. Comput. Appl. Res."},{"key":"1081_CR11","first-page":"9","volume":"4","author":"R Gupta","year":"2014","unstructured":"Gupta, R., Saxena, R.R.: Set packing problem with linear fractional objective function. Int. J. Math. Comput. Appl. Res. 4, 9\u201318 (2014)","journal-title":"Int. J. Math. Comput. Appl. Res."},{"key":"1081_CR12","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.1110.0509","volume":"36","author":"SN Kabadi","year":"2011","unstructured":"Kabadi, S.N., Punnen, A.P.: An $$O(n^4)$$ O ( n 4 ) algorithm for the QAP linearization problem. Math. Oper. Res. 36, 754\u2013761 (2011)","journal-title":"Math. Oper. Res."},{"key":"1081_CR13","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1287\/opre.19.4.998","volume":"19","author":"CE Lemke","year":"1971","unstructured":"Lemke, C.E., Salkin, H.M., Spielberg, K.: Set covering by single branch enumeration with linear programming sub-problem. Oper. Res. 19, 998\u20131022 (1971)","journal-title":"Oper. Res."},{"key":"1081_CR14","doi-asserted-by":"crossref","unstructured":"Liberti L.: Compact linearization for binary quadratic problems. 4OR 5:231\u2013245 (2007)","DOI":"10.1007\/s10288-006-0015-3"},{"key":"1081_CR15","unstructured":"Periannan, M.: An ant-based algotithm for the minimum vertex cover problem: Thesis. The Pennsylvania State University, Master of Science (2007)"},{"key":"1081_CR16","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.disopt.2013.02.003","volume":"10","author":"AP Punnen","year":"2013","unstructured":"Punnen, A.P., Kabadi, S.N.: A linear time algorithm for the Koopmans-Beckman QAP linearization and related problems. Discrete Optim. 10, 200\u2013209 (2013)","journal-title":"Discrete Optim."},{"key":"1081_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1080\/02331939708844269","volume":"39","author":"RR Saxena","year":"1997","unstructured":"Saxena, R.R., Arora, S.R.: A linearization technique for solving the quadratic set covering problem. Optimization 39, 33\u201342 (1997)","journal-title":"Optimization"},{"key":"1081_CR18","unstructured":"Xu, K.: http:\/\/www.nlsde.buaa.edu.cn\/~kexu\/benchmarks\/graph-benchmarks.htm"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1081-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1081-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1081-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T10:23:50Z","timestamp":1568370230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1081-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,15]]},"references-count":18,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["1081"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1081-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,15]]}}}