{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:57:15Z","timestamp":1743091035357,"version":"3.40.3"},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070001"},{"type":"electronic","value":"9783319070018"}],"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-07001-8_26","type":"book-chapter","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T15:13:03Z","timestamp":1404918783000},"page":"193-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Generalization of Odd Set Inequalities for the Set Packing Problem"],"prefix":"10.1007","author":[{"given":"Olga","family":"Heismann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Bornd\u00f6rfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"key":"26_CR1","unstructured":"Bornd\u00f6rfer, R. (1998). Aspects of set packing, partitioning, and covering, PhD thesis, TU Berlin."},{"key":"26_CR2","unstructured":"Bornd\u00f6rfer, R., Heismann, O. (2012). The hypergraph assignment problem. Technical Report 12\u201314, ZIB."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Edmonds, J. (1965). Maximum matching and a polyhedron with 0, 1-vertices. Journal of Research of the National Bureau of Standards, 69, 125\u2013130.","DOI":"10.6028\/jres.069B.013"},{"key":"26_CR4","volume-title":"Computers and intractability: A guide to the theory of NP-completeness (Series of books in the mathematical sciences)","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness (Series of books in the mathematical sciences). San Francisco: W.H. Freeman."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"P\u00eacher, A., & Wagler, A. (2006). Generalized clique family inequalities for claw-free graphs. Electronic Notes in Discrete Mathematics, 25, 117\u2013121.","DOI":"10.1016\/j.endm.2006.06.082"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07001-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T21:08:36Z","timestamp":1674162516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07001-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070001","9783319070018"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07001-8_26","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}