{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T06:14:36Z","timestamp":1744697676327,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332708"},{"type":"electronic","value":"9783031332715"}],"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-33271-5_6","type":"book-chapter","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:04Z","timestamp":1684774984000},"page":"79-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Mixed-Integer Linear Programming Reduction of\u00a0Disjoint Bilinear Programs via\u00a0Symbolic Variable Elimination"],"prefix":"10.1007","author":[{"given":"Jihwan","family":"Jeong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Sanner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akshat","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s101070050072","volume":"85","author":"C Audet","year":"1999","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: A symmetrical linear maxmin approach to disjoint bilinear programming. Math. Program. 85(3), 573\u2013592 (1999)","journal-title":"Math. Program."},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Becker, R., Zilberstein, S., Lesser, V., Goldman, C.V.: Transition-independent decentralized markov decision processes. In: Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 41\u201348. AAMAS 2003, Association for Computing Machinery, New York (2003). https:\/\/doi.org\/10.1145\/860575.860583","DOI":"10.1145\/860575.860583"},{"key":"6_CR3","unstructured":"Boutilier, C., Reiter, R., Price, B.: Symbolic dynamic programming for first-order MDPs. In: IJCAI-01, pp. 690\u2013697. Seattle (2001)"},{"key":"6_CR4","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2021). https:\/\/www.gurobi.com"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Horst, R., Pardalos, P., Van Thoai, N.: Introduction to Global Optimization. Nonconvex Optimization and Its Applications. Springer, US (1995). https:\/\/books.google.ca\/books?id=w6bRM8W-oTgC","DOI":"10.1007\/978-1-4615-2025-2"},{"key":"6_CR6","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"2013","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Heidelberg (2013)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Jeong, J., Jaggi, P., Sanner, S.: Symbolic dynamic programming for continuous state mdps with linear program transitions. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21). Online (2021)","DOI":"10.24963\/ijcai.2021\/562"},{"key":"6_CR8","unstructured":"Konno, H.: A Bilinear Programming: Part II. Applications of Bilinear Programming, Technical report (1975)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Nahapetyan, A.G.: Bilinear Programming: Applications in the Supply Chain Management, pp. 282\u2013288. Springer, Boston (2009)","DOI":"10.1007\/978-0-387-74759-0_49"},{"issue":"1","key":"6_CR10","first-page":"235","volume":"35","author":"M Petrik","year":"2009","unstructured":"Petrik, M., Zilberstein, S.: A bilinear programming approach for multiagent planning. J. Artif. Int. Res. 35(1), 235\u2013274 (2009)","journal-title":"J. Artif. Int. Res."},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Rebennack, S., Nahapetyan, A., Pardalos, P.M.: Bilinear modeling solution approach for fixed charge network flow problems. Optim. Lett. 3(3), 347\u2013355 (2009). https:\/\/doi.org\/10.1007\/s11590-009-0114-0, https:\/\/doi.org\/10.1007\/s11590-009-0114-0","DOI":"10.1007\/s11590-009-0114-0"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Sanner, S., Abbasnejad, E.: Symbolic variable elimination for discrete and continuous graphical models. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 26. no. 1, pp. 1954\u20131960 (2012)","DOI":"10.1609\/aaai.v26i1.8406"},{"key":"6_CR13","unstructured":"Sanner, S., Delgado, K.V., de Barros, L.N.: Symbolic dynamic programming for discrete and continuous state MDPs. In: Proceedings of the 27th Conference on Uncertainty in AI (UAI-2011). Barcelona (2011)"},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali, H.D., Alameddine, A.: A new reformulation-linearization technique for bilinear programming problems. J. Global Optim. 2(4), 379\u2013410 (1992)","journal-title":"J. Global Optim."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF00249639","volume":"1","author":"LN Vicente","year":"1992","unstructured":"Vicente, L.N., Calamai, P.H., J\u00fadice, J.J.: Generation of disjointly constrained bilinear programming test problems. Comput. Optim. Appl. 1, 299\u2013306 (1992)","journal-title":"Comput. Optim. Appl."},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Ye, Z., Say, B., Sanner, S.: Symbolic bucket elimination for piecewise continuous constrained optimization. In: CPAIOR, pp. 585\u2013594 (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_42","DOI":"10.1007\/978-3-319-93031-2_42"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Zamani, Z., Sanner, S., Fang, C.: Symbolic dynamic programming for continuous state and action MDPs. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI-12). Toronto, Canada (2012)","DOI":"10.1609\/aaai.v26i1.8372"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33271-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:53Z","timestamp":1684775033000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33271-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332708","9783031332715"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33271-5_6","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":"23 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"29 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2023","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":"71","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":"26","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":"6","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":"37% - 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":"4","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)"}}]}}