{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:56Z","timestamp":1742913776344,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319533742"},{"type":"electronic","value":"9783319533759"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53375-9_4","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T08:03:43Z","timestamp":1486022623000},"page":"60-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Near-Boolean Optimization: A Continuous Approach to Set Packing and Partitioning"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Rossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,3]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-Boolean optimization. Discrete Appl. Math. 123, 155\u2013225 (2002)","journal-title":"Discrete Appl. Math."},{"key":"4_CR2","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511780448","volume-title":"Boolean Models and Methods in Mathematics, Computer Science, and Engineering","author":"Y Crama","year":"2010","unstructured":"Crama, Y., Hammer, P.L.: Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Encyclopedia of Mathematics and its Applications, vol. 134. Cambridge University Press, Cambridge (2010)"},{"key":"4_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511852008","volume-title":"Boolean Functions: Theory, Algorithms, and Applications","author":"Y Crama","year":"2011","unstructured":"Crama, Y., Hammer, P.L.: Boolean Functions: Theory, Algorithms, and Applications. Cambridge University Press, Cambridge (2011)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Rossi, G.: Continuous set packing and near-Boolean functions. In: Proceedings of 5th International Conference on Pattern Recognition Applications and Methods, pp. 84\u201396 (2016)","DOI":"10.5220\/0005697800840096"},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21711-5","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2002","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Heidelberg (2002)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings 33rd ACM Symposium on Theory of Computing, pp. 453\u2013461 (2001)","DOI":"10.1145\/380752.380839"},{"key":"4_CR7","volume-title":"Computational Complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison Wesley, Boston (1994)"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating $$k$$-set packing. Comput. Complex. 15(1), 20\u201339 (2006)","journal-title":"Comput. Complex."},{"issue":"1\u20132","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T Sandholm","year":"2002","unstructured":"Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artif. Intell. 135(1\u20132), 1\u201354 (2002)","journal-title":"Artif. Intell."},{"key":"4_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813825","volume-title":"Putting Auction Theory to Work","author":"P Milgrom","year":"2004","unstructured":"Milgrom, P.: Putting Auction Theory to Work. Cambridge University Press, Cambridge (2004)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.ejor.2006.12.068","volume":"186","author":"B Alidaee","year":"2008","unstructured":"Alidaee, B., Kochenberger, G., Lewis, K., Lewis, M., Wang, H.: A new approach for modeling and solving set packing problems. Eur. J. Oper. Res. 186, 504\u2013512 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1006\/jagm.2000.1155","volume":"39","author":"B Chandra","year":"2001","unstructured":"Chandra, B., Halld\u00f3rsson, M.M.: Greedy local improvement and weighted set packing. J. Algorithms 39(2), 223\u2013240 (2001)","journal-title":"J. Algorithms"},{"key":"4_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59101-3","volume-title":"Combinatorial Theory","author":"M Aigner","year":"1997","unstructured":"Aigner, M.: Combinatorial Theory. Springer, Heidelberg (1997)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/BF00531932","volume":"2","author":"GC Rota","year":"1964","unstructured":"Rota, G.C.: On the foundations of combinatorial theory I: theory of M\u00f6bius functions. Z. Wahrscheinlichkeitsrechnung u. verw. Geb. 2, 340\u2013368 (1964)","journal-title":"Z. Wahrscheinlichkeitsrechnung u. verw. Geb."},{"key":"4_CR15","volume-title":"Microeconomic Theory","author":"A Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)"},{"key":"4_CR16","volume-title":"Convex Polytopes","author":"B Gr\u00fcnbaum","year":"2001","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes, 2nd edn. Springer, Heidelberg (2001)","edition":"2"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01541028","volume":"36","author":"P Hammer","year":"1992","unstructured":"Hammer, P., Holzman, R.: Approximations of Pseudo-Boolean functions; applications to game theory. Math. Methods Oper. Res. - ZOR 36, 3\u201321 (1992)","journal-title":"Math. Methods Oper. Res. - ZOR"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/BF02944981","volume":"1","author":"R Stanley","year":"1971","unstructured":"Stanley, R.: Modular elements of geometric lattices. Algebra Universalis 1, 214\u2013217 (1971)","journal-title":"Algebra Universalis"},{"issue":"2","key":"4_CR19","first-page":"120","volume":"20","author":"I Gilboa","year":"1990","unstructured":"Gilboa, I., Lehrer, E.: Global games. Int. J. Game Theory 20(2), 120\u2013147 (1990)","journal-title":"Int. J. Game Theory"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0304-4068(91)90002-B","volume":"20","author":"I Gilboa","year":"1991","unstructured":"Gilboa, I., Lehrer, E.: The value of information - an axiomatic approach. J. Math. Econ. 20, 443\u2013459 (1991)","journal-title":"J. Math. Econ."},{"key":"4_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511665578","volume-title":"Semimodular Lattices. Theory and Applications","author":"M Stern","year":"1999","unstructured":"Stern, M.: Semimodular Lattices. Theory and Applications. Cambridge University Press, Cambridge (1999)"},{"key":"4_CR22","volume-title":"The Art of Computer Programming, Volume 4, Fascicle 3, Generating all Combinations and Partitions","author":"DE Knuth","year":"2005","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 4, Fascicle 3, Generating all Combinations and Partitions. Addison-Wesley, Boston (2005)"},{"key":"4_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803895","volume-title":"Combinatorics: The Rota Way","author":"JPS Kung","year":"2009","unstructured":"Kung, J.P.S., Rota, G.C., Yan, C.H.: Combinatorics: The Rota Way. Cambridge University Press, Cambridge (2009)"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1090\/S0002-9947-04-03623-2","volume":"358","author":"MH Rosas","year":"2006","unstructured":"Rosas, M.H., Sagan, B.E.: Symmetric functions in noncommuting variables. Trans. Am. Math. Soc. 358, 215\u2013232 (2006)","journal-title":"Trans. Am. Math. Soc."},{"key":"4_CR25","volume-title":"Enumerative Combinatorics","author":"R Stanley","year":"2012","unstructured":"Stanley, R.: Enumerative Combinatorics, vol. 2, 2nd edn. Cambridge University Press, Cambridge (2012)","edition":"2"},{"key":"4_CR26","unstructured":"Schrijver, A.: A Course in Combinatorial Optimization. Alexander Schrijver (2013). http:\/\/homepages.cwi.nl\/~lex\/files\/dict.pdf"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1006\/game.2001.0846","volume":"37","author":"M Slikker","year":"2001","unstructured":"Slikker, M.: Coalition formation and potential games. Games Econ. Beh. 37, 436\u2013448 (2001)","journal-title":"Games Econ. Beh."},{"key":"4_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511528446","volume-title":"The Shapley Value","author":"A Roth","year":"1988","unstructured":"Roth, A.: The Shapley Value. Cambridge University Press, Cambridge (1988)"},{"key":"4_CR29","volume-title":"Microeconomics: Behavior, Institutions, and Evolution","author":"S Bowles","year":"2004","unstructured":"Bowles, S.: Microeconomics: Behavior, Institutions, and Evolution. Princeton University Press, Princeton (2004)"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games Econ. Beh. 14, 124\u2013143 (1996)","journal-title":"Games Econ. Beh."},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.artint.2006.01.005","volume":"170","author":"V Conitzer","year":"2006","unstructured":"Conitzer, V., Sandholm, T.: Complexity of constructing solutions in the core based on synergies among coalitions. Artif. Intel. 170, 607\u2013619 (2006)","journal-title":"Artif. Intel."},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.artint.2007.03.002","volume":"171","author":"T Rahwan","year":"2007","unstructured":"Rahwan, T., Jenning, N.: An algorithm for distributing coalitional value calculations among cooperating agents. Artif. Intell. 171, 535\u2013567 (2007)","journal-title":"Artif. Intell."},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Rossi, G.: Multilinear objective function-based clustering. In: Proceedings of 7th International Joint Conference on Computational Intelligence, vol. 2(FCTA), pp. 141\u2013149 (2015)","DOI":"10.5220\/0005592701410149"},{"key":"4_CR34","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1, 27\u201364 (2007)","journal-title":"Comput. Sci. Rev."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition Applications and Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53375-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:34:02Z","timestamp":1710326042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-53375-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319533742","9783319533759"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53375-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"3 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPRAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Pattern Recognition Applications and Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 February 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 February 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpram2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}