乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:24:58Z","timestamp":1743017098937,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_13","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"172-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Designing Optimization Problems with\u00a0Diverse Solutions"],"prefix":"10.1007","author":[{"given":"Oussama","family":"Hanguir","sequence":"first","affiliation":[]},{"given":"Will","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Christopher Thomas","family":"Ryan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Beck, M., Robins, S.: Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra. Springer, NY (2007). https:\/\/doi.org\/10.1007\/978-0-387-46112-0","DOI":"10.1007\/978-0-387-46112-0"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Chen, N., Elmachtoub, A.N., Hamilton, M.L., Lei, X.: Loot box pricing and design. Management Science (forthcoming) (2020)","DOI":"10.2139\/ssrn.3430125"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Z., et al.: EOMM: An engagement optimized matchmaking framework. In: Proceedings of the 26th International Conference on World Wide Web, pp. 1143\u20131150 (2017)","DOI":"10.1145\/3038912.3052559"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"De Loera, J.A., Rambau, J., Santos, F.: Triangulations: Structures for Algorithms and Applications. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12971-1","DOI":"10.1007\/978-3-642-12971-1"},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1287\/moor.1080.0320","volume":"33","author":"F Eisenbrand","year":"2008","unstructured":"Eisenbrand, F., Shmonin, G.: Parametric integer programming in fixed dimension. Math. Oper. Res. 33(4), 839\u2013850 (2008)","journal-title":"Math. Oper. Res."},{"key":"13_CR6","unstructured":"Gribanov, D., Malyshev, D., Pardalos, P.: Parametric integer programming in the average case: sparsity, proximity, and FPT-algorithms. arXiv preprint arXiv:2002.01307 (2020)"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1287\/isre.2018.0812","volume":"30","author":"H Guo","year":"2019","unstructured":"Guo, H., Hao, L., Mukhopadhyay, T., Sun, D.: Selling virtual currency in digital games: implications for gameplay and social welfare. Inf. Syst. Res. 30(2), 430\u2013446 (2019)","journal-title":"Inf. Syst. Res."},{"issue":"10","key":"13_CR8","doi-asserted-by":"publisher","first-page":"2413","DOI":"10.1111\/poms.13015","volume":"28","author":"H Guo","year":"2019","unstructured":"Guo, H., Zhao, X., Hao, L., Liu, D.: Economic analysis of reward advertising. Prod. Oper. Manag. 28(10), 2413\u20132430 (2019)","journal-title":"Prod. Oper. Manag."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Huang, Y., Jasin, S., Manchanda, P.: \u201cLevel up\u201d: leveraging skill and engagement to maximize player game-play in online video games. Information Systems Research 30(3), 927\u2013947 (2019)","DOI":"10.1287\/isre.2019.0839"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01405094","volume":"88","author":"G Kalai","year":"1987","unstructured":"Kalai, G.: Rigidity and the lower bound theorem 1. Invent. Math. 88(1), 125\u2013151 (1987)","journal-title":"Invent. Math."},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1970","unstructured":"McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika 17(2), 179\u2013184 (1970)","journal-title":"Mathematika"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Mills, H.: Marginal values of matrix games and linear programs. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems, pp. 183\u2013194. Princeton University Press (1956)","DOI":"10.1515\/9781400881987-009"},{"key":"13_CR13","unstructured":"Ryan, C.T., Sheng, L., Zhao, X.: Selling enhanced attempts. Available at SSRN 3751523 (2020)"},{"issue":"3","key":"13_CR14","first-page":"316","volume":"2","author":"T Saaty","year":"1954","unstructured":"Saaty, T., Gass, S.: Parametric objective function (part 1). J. Oper. Res. Soc. Am. 2(3), 316\u2013319 (1954)","journal-title":"J. Oper. Res. Soc. Am."},{"key":"13_CR15","unstructured":"Sheng, L., Ryan, C.T., Nagarajan, M., Cheng, Y., Tong, C.: Incentivized actions in freemium games. Manufacturing & Service Operations Management (2020)"},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02614622","volume":"77","author":"B Sturmfels","year":"1997","unstructured":"Sturmfels, B., Thomas, R.R.: Variation of cost functions in integer programming. Math. Program. 77(2), 357\u2013387 (1997)","journal-title":"Math. Program."},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.1100.0852","volume":"59","author":"J Turner","year":"2011","unstructured":"Turner, J., Scheller-Wolf, A., Tayur, S.: Scheduling of dynamic in-game advertising. Oper. Res. 59(1), 1\u201316 (2011)","journal-title":"Oper. Res."},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"465","DOI":"10.2140\/pjm.1969.28.465","volume":"28","author":"D Walkup","year":"1969","unstructured":"Walkup, D., Wets, R.: Lifting projections of convex polyhedra. Pac. J. Math. 28(2), 465\u2013475 (1969)","journal-title":"Pac. J. Math."},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1137\/0111006","volume":"11","author":"A Williams","year":"1963","unstructured":"Williams, A.: Marginal values in linear programming. J. Soc. Ind. Appl. Math. 11(1), 82\u201394 (1963)","journal-title":"J. Soc. Ind. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32726-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:30:13Z","timestamp":1684701013000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","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":"Madison, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","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":"119","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":"28% - 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":"2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}