{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:25:12Z","timestamp":1743031512443,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030457709"},{"type":"electronic","value":"9783030457716"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45771-6_29","type":"book-chapter","created":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T21:03:32Z","timestamp":1586811812000},"page":"378-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sequence Independent Lifting for the Set of Submodular Maximization Problem"],"prefix":"10.1007","author":[{"given":"Xueyu","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,14]]},"reference":[{"issue":"1\u20132","key":"29_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10107-009-0298-1","volume":"128","author":"S Ahmed","year":"2011","unstructured":"Ahmed, S., Atamt\u00fcrk, A.: Maximizing a class of submodular utility functions. Math. Program. 128(1\u20132), 149\u2013169 (2011). \nhttps:\/\/doi.org\/10.1007\/s10107-009-0298-1","journal-title":"Math. Program."},{"issue":"1\u20132","key":"29_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-015-0902-5","volume":"154","author":"A Angulo","year":"2015","unstructured":"Angulo, A., Espinoza, D., Palma, R.: Sequence independent lifting for mixed Knapsack problems with GUB constraints. Math. Program. 154(1\u20132), 55\u201380 (2015). \nhttps:\/\/doi.org\/10.1007\/s10107-015-0902-5","journal-title":"Math. Program."},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"1943","DOI":"10.1137\/15M1033009","volume":"27","author":"A Atamt\u00fcrk","year":"2017","unstructured":"Atamt\u00fcrk, A., K\u00fc\u00e7\u00fckyavuz, S., Tezel, B.: Path cover and path pack inequalities for the capacitated fixed-charge network flow problem. SIAM J. Optimiz. 27(3), 1943\u20131976 (2017)","journal-title":"SIAM J. Optimiz."},{"key":"29_CR4","unstructured":"Chen, L., Xu, J., Lu, Z.: Contextual combinatorial multi-armed bandits with volatile arms and submodular reward. In: Advances in Neural Information Processing Systems, pp. 3247\u20133256 (2018)"},{"key":"29_CR5","unstructured":"Dolhansky, B.W., Bilmes, J.A.: Deep submodular functions: definitions and learning. In: Advances in Neural Information Processing Systems, pp. 3404\u20133412 (2016)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"El-Arini, K., Veda, G., Shahaf, D., Guestrin, C.: Turning down the noise in the blogosphere. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 289\u2013298. ACM (2009)","DOI":"10.1145\/1557019.1557056"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Z Gu","year":"2000","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.: Sequence independent lifting in mixed integer programming. J. Comb. Optimiz. 4(1), 109\u2013129 (2000). \nhttps:\/\/doi.org\/10.1023\/A:1009841107478","journal-title":"J. Comb. Optimiz."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Li, J., Deshpande, A.: Maximizing expected utility for stochastic combinatorial optimization problems. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 797\u2013806. IEEE (2011)","DOI":"10.1109\/FOCS.2011.33"},{"key":"29_CR9","unstructured":"Lin, H., Bilmes, J.: A class of submodular functions for document summarization. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies-Volume 1, pp. 510\u2013520. Association for Computational Linguistics (2011)"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H Marchand","year":"1999","unstructured":"Marchand, H., Wolsey, L.A.: The 0-1 Knapsack problem with a single continuous variable. Math. Program. 85(1), 15\u201333 (1999). \nhttps:\/\/doi.org\/10.1007\/s101070050044","journal-title":"Math. Program."},{"key":"29_CR11","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"29_CR12","unstructured":"Stobbe, P., Krause, A.: Efficient minimization of decomposable submodular functions. In: Advances in Neural Information Processing Systems, pp. 2208\u20132216 (2010)"},{"issue":"3","key":"29_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(89)90036-9","volume":"8","author":"LA Wolsey","year":"1989","unstructured":"Wolsey, L.A.: Submodularity and valid inequalities in capacitated fixed charge networks. Oper. Res. Lett. 8(3), 119\u2013124 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132","key":"29_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-016-1033-3","volume":"162","author":"J Yu","year":"2017","unstructured":"Yu, J., Ahmed, S.: Maximizing a class of submodular utility functions with constraints. Math. Program. 162(1\u20132), 145\u2013164 (2017). \nhttps:\/\/doi.org\/10.1007\/s10107-016-1033-3","journal-title":"Math. Program."},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-72792-7_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"B Zeng","year":"2007","unstructured":"Zeng, B., Richard, J.-P.P.: A framework to derive multidimensional superadditive lifting functions and its applications. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 210\u2013224. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-72792-7_17"},{"issue":"2","key":"29_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.disopt.2010.09.004","volume":"8","author":"B Zeng","year":"2011","unstructured":"Zeng, B., Richard, J.P.P.: A polyhedral study on 0\u20131 knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting. Discrete Optimiz. 8(2), 259\u2013276 (2011)","journal-title":"Discrete Optimiz."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45771-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T23:12:54Z","timestamp":1589929974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45771-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457709","9783030457716"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45771-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.xixilogic.org\/events\/clar2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}