{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:32:44Z","timestamp":1767137564316,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_8","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"87-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Integer Programming Formulation for the Maximum k-Subset Intersection Problem"],"prefix":"10.1007","author":[{"given":"Eduardo T.","family":"Bogue","sequence":"first","affiliation":[]},{"given":"Cid C.","family":"de Souza","sequence":"additional","affiliation":[]},{"given":"Eduardo C.","family":"Xavier","sequence":"additional","affiliation":[]},{"given":"Alexandre S.","family":"Freire","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Acu\u00f1a, V., Ferreira, C.E., Freire, A.S., Moreno, E.: Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. Discrete Appl. Math. (2011, in press). doi:10.1016\/j.dam.2011.09.019","DOI":"10.1016\/j.dam.2011.09.019"},{"key":"8_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13287-2","volume-title":"Music Recommendation and Discovery in the Long Tail","author":"O Celma","year":"2010","unstructured":"Celma, O.: Music Recommendation and Discovery in the Long Tail. Springer, Berlin (2010)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF00383449","volume":"8","author":"B Ganter","year":"1991","unstructured":"Ganter, B., Reuter, K.: Finding all closed sets: a general approach. Order 8, 283\u2013290 (1991). doi:10.1007\/BF00383449","journal-title":"Order"},{"key":"8_CR4","first-page":"1","volume-title":"Interfaces in Computer Science and Operations Research","author":"F Glover","year":"1996","unstructured":"Glover, F.: Tabu search and adaptive memory programing advances, applications and challenges. In: Barr, R.S., et al. (eds.) Interfaces in Computer Science and Operations Research, pp. 1\u201375. Kluwer, Dordrecht (1996)"},{"issue":"5","key":"8_CR5","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1057\/jors.1992.71","volume":"43","author":"GL Nemhauser","year":"1992","unstructured":"Nemhauser, G.L., Sigismondi, G.: A strong cutting plane\/branch-and-bound algorithm for node packing. J. Oper. Res. Soc. 43(5), 443\u2013457 (1992)","journal-title":"J. Oper. Res. Soc."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-14031-0_17","volume-title":"Computing and Combinatorics","author":"D Nussbaum","year":"2010","unstructured":"Nussbaum, D., Pu, S., Sack, J.-R., Uno, T., Zarrabi-Zadeh, H.: Finding maximum edge bicliques in convex bipartite graphs. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 140\u2013149. Springer, Heidelberg (2010)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1111\/j.1475-3995.2011.00805.x","volume":"19","author":"S Rebennack","year":"2012","unstructured":"Rebennack, S., Reinelt, G., Pardalos, P.M.: A tutorial on branch and cut algorithms for the maximum stable set problem. Int. Trans. Oper. Res. 19, 161\u2013199 (2012)","journal-title":"Int. Trans. Oper. Res."},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of Metaheuristics","author":"MGC Resende","year":"2003","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 219\u2013249. Springer, New York (2003)"},{"key":"8_CR9","unstructured":"Vinterbo, S.A.: A note on the hardness of the k-ambiguity problem. Technical report, Harvard Medical School, Boston, MA, USA (2002)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.ipl.2012.03.007","volume":"112","author":"EC Xavier","year":"2012","unstructured":"Xavier, E.C.: A note on a maximum k-subset intersection problem. Inf. Process. Lett. 112, 471\u2013472 (2012)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T21:09:16Z","timestamp":1703192956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":10,"aliases":["10.1007\/978-3-319-14115-2_8"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}