{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:37:26Z","timestamp":1742913446284,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031069000"},{"type":"electronic","value":"9783031069017"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06901-7_17","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:22:30Z","timestamp":1653610950000},"page":"223-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["LP-Based Approximations for\u00a0Disjoint Bilinear and\u00a0Two-Stage Adjustable Robust Optimization"],"prefix":"10.1007","author":[{"given":"Omar El","family":"Housni","sequence":"first","affiliation":[]},{"given":"Ayoub","family":"Foussoul","sequence":"additional","affiliation":[]},{"given":"Vineet","family":"Goyal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,27]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-012-0567-2","volume":"134","author":"C Bandi","year":"2012","unstructured":"Bandi, C., Bertsimas, D.: Tractable stochastic analysis in high dimensions via robust optimization. Math. Program. 134(1), 23\u201370 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0567-2","journal-title":"Math. Program."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Program. 99, 351\u2013376 (2004). https:\/\/doi.org\/10.1007\/s10107-003-0454-y","journal-title":"Math. Program."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-019-01385-0","volume":"182","author":"A Ben-Tal","year":"2019","unstructured":"Ben-Tal, A., El Housni, O., Goyal, V.: A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization. Math. Program. 182, 57\u2013102 (2019). https:\/\/doi.org\/10.1007\/s10107-019-01385-0","journal-title":"Math. Program."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-011-0444-4","volume":"134","author":"D Bertsimas","year":"2012","unstructured":"Bertsimas, D., Goyal, V.: On the power and limitations of affine policies in two-stage adaptive optimization. Math. Program. 134, 491\u2013531 (2012). https:\/\/doi.org\/10.1007\/s10107-011-0444-4","journal-title":"Math. Program."},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10107-014-0818-5","volume":"153","author":"D Bertsimas","year":"2014","unstructured":"Bertsimas, D., Bidkhori, H.: On the performance of affine policies for two-stage adaptive optimization: a geometric perspective. Math. Program. 153(2), 577\u2013594 (2014). https:\/\/doi.org\/10.1007\/s10107-014-0818-5","journal-title":"Math. Program."},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/ijoc.2016.0689","volume":"28","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., Ruiter, F.: Duality in two-stage adaptive linear optimization: faster computation and stronger bounds. INFORMS J. Comput. 28, 500\u2013511 (2016)","journal-title":"INFORMS J. Comput."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52, 35\u201353 (2004)","journal-title":"Oper. Res."},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516516","volume":"56","author":"X Chen","year":"2009","unstructured":"Chen, X., Deng, X., Teng, S.H.: Settling the complexity of computing two-player nash equilibria. J. ACM 56(3), 1\u201357 (2009)","journal-title":"J. ACM"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23(4), 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Dhamdhere, K., Goyal, V., Ravi, R., Singh, M.: How to pay, come what may: approximation algorithms for demand-robust covering problems. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201905), pp. 367\u2013376 (2005)","DOI":"10.1109\/SFCS.2005.42"},{"key":"17_CR12","unstructured":"El Housni, O., Goyal, V.: Beyond worst-case: a probabilistic analysis of affine policies in dynamic optimization. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 4759\u20134767 (2017)"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/moor.2020.1082","volume":"46","author":"O El Housni","year":"2021","unstructured":"El Housni, O., Goyal, V.: On the optimality of affine policies for budgeted uncertainty sets. Math. Oper. Res. 46(2), 674\u2013711 (2021)","journal-title":"Math. Oper. Res."},{"key":"17_CR14","unstructured":"EL Housni, O., Goyal, V., Hanguir, O., Stein, C.: Matching drivers to riders: a two-stage robust approach. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2021), vol. 207, pp. 12:1\u201312:22 (2021)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-030-73879-2_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"O El Housni","year":"2021","unstructured":"El Housni, O., Goyal, V., Shmoys, D.: On the power of static assignment policies for robust facility location problems. In: Singh, M., Williamson, D.P. (eds.) IPCO 2021. LNCS, vol. 12707, pp. 252\u2013267. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-73879-2_18"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-540-72792-7_33","volume-title":"Integer Programming and Combinatorial Optimization","author":"U Feige","year":"2007","unstructured":"Feige, U., Jain, K., Mahdian, M., Mirrokni, V.: Robust combinatorial optimization with exponential scenarios. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 439\u2013453. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_33"},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-030-73879-2_18","volume":"64","author":"K Firouzbakht","year":"2016","unstructured":"Firouzbakht, K., Noubir, G., Salehi, M.: On the power of static assignment policies for robust facility location problems. IEEE Trans. Commun. 64(1), 429\u2013440 (2016). https:\/\/doi.org\/10.1007\/978-3-030-73879-2_18","journal-title":"IEEE Trans. Commun."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A Geoffrion","year":"1972","unstructured":"Geoffrion, A.: Generalized benders decomposition. J. Optim. Theory Appl. 10, 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"key":"17_CR19","first-page":"1139","volume":"50","author":"C Gounaris","year":"2014","unstructured":"Gounaris, C., Repoussis, P., Tarantilis, C., Wiesemann, W., Floudas, C.: An adaptive memory programming framework for the robust capacitated vehicle routing problem. Transp. Sci. 50, 1139\u20131393 (2014)","journal-title":"Transp. Sci."},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2746226","volume":"12","author":"A Gupta","year":"2015","unstructured":"Gupta, A., Nagarajan, V., Ravi, R.: Robust and maxmin optimization under matroid and knapsack uncertainty sets. ACM Trans. Algorithms 12(1), 1\u201321 (2015)","journal-title":"ACM Trans. Algorithms"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10107-013-0705-5","volume":"146","author":"A Gupta","year":"2014","unstructured":"Gupta, A., Nagarajan, V., Ravi, R.: Thresholded covering algorithms for robust and max-min optimization. Math. Program. 146, 583\u2013615 (2014). https:\/\/doi.org\/10.1007\/s10107-013-0705-5","journal-title":"Math. Program."},{"issue":"3","key":"17_CR22","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10898-016-0434-4","volume":"67","author":"A Gupte","year":"2016","unstructured":"Gupte, A., Ahmed, S., Dey, S.S., Cheon, M.S.: Relaxations and discretizations for the pooling problem. J. Glob. Optim. 67(3), 631\u2013669 (2016). https:\/\/doi.org\/10.1007\/s10898-016-0434-4","journal-title":"J. Glob. Optim."},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/S0377-2217(97)00066-0","volume":"105","author":"I Harjunkoski","year":"1998","unstructured":"Harjunkoski, I., Westerlund, T., P\u00f6rn, R., Skrifvars, H.: Different transformations for solving non-convex trim-loss problems by minlp. Eur. J. Oper. Res. 105, 594\u2013603 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H Konno","year":"1976","unstructured":"Konno, H.: A cutting plane algorithm for solving bilinear programs. Math. Program. 11, 14\u201327 (1976). https:\/\/doi.org\/10.1007\/BF01580367","journal-title":"Math. Program."},{"issue":"1","key":"17_CR25","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/07408170600729192","volume":"39","author":"C Lim","year":"2007","unstructured":"Lim, C., Smith, J.C.: Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Trans. 39(1), 15\u201326 (2007)","journal-title":"IIE Trans."},{"issue":"3","key":"17_CR26","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-247X(64)90021-6","volume":"9","author":"O Mangasarian","year":"1964","unstructured":"Mangasarian, O., Stone, H.: Two-person nonzero-sum games and quadratic programming. J. Math. Anal. Appl. 9(3), 348\u2013355 (1964)","journal-title":"J. Math. Anal. Appl."},{"key":"17_CR27","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11590-009-0114-0","volume":"3","author":"S Rebennack","year":"2009","unstructured":"Rebennack, S., Nahapetyan, A., Pardalos, P.: Bilinear modeling solution approach for fixed charge network flow problems. Optim. Lett. 3, 347\u2013355 (2009). https:\/\/doi.org\/10.1007\/s11590-009-0114-0","journal-title":"Optim. Lett."},{"key":"17_CR28","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1287\/opre.22.2.373","volume":"22","author":"R Soland","year":"1974","unstructured":"Soland, R.: Optimal facility location with concave costs. Oper. Res. 22, 373\u2013382 (1974)","journal-title":"Oper. Res."},{"issue":"1\u20133","key":"17_CR29","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01580766","volume":"41","author":"TV Thieu","year":"1988","unstructured":"Thieu, T.V.: A note on the solution of bilinear programming problems by reduction to concave minimization. Math. Program. 41(1\u20133), 249\u2013260 (1988). https:\/\/doi.org\/10.1007\/BF01580766","journal-title":"Math. Program."},{"issue":"2","key":"17_CR30","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1002\/nav.3800230212","volume":"23","author":"H Vaish","year":"1976","unstructured":"Vaish, H., Shetty, C.M.: The bilinear programming problem. Nav. Res. Logistics Q. 23(2), 303\u2013309 (1976)","journal-title":"Nav. Res. Logistics Q."},{"issue":"1","key":"17_CR31","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10589-017-9974-x","volume":"70","author":"G Xu","year":"2017","unstructured":"Xu, G., Burer, S.: A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides. Comput. Optim. Appl. 70(1), 33\u201359 (2017). https:\/\/doi.org\/10.1007\/s10589-017-9974-x","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"17_CR32","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.2017.1714","volume":"66","author":"J Zhen","year":"2018","unstructured":"Zhen, J., den Hertog, D., Sim, M.: Adjustable robust optimization via fourier-motzkin elimination. Oper. Res. 66(4), 1086\u20131100 (2018)","journal-title":"Oper. Res."},{"key":"17_CR33","unstructured":"Zhen, J., Marandi, A., den Hertog, D., Vandenberghe, L.: Disjoint bilinear programming: a two-stage robust optimization perspective. Optimization Online (2018). www.optimization-online.org\/DB_HTML\/2018\/06\/6685.html"},{"issue":"1","key":"17_CR34","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10107-017-1111-1","volume":"166","author":"A \u0106usti\u0107","year":"2017","unstructured":"\u0106usti\u0107, A., Sokol, V., Punnen, A.P., Bhattacharya, B.: The bilinear assignment problem: complexity and polynomially solvable special cases. Math. Program. 166(1), 185\u2013205 (2017). https:\/\/doi.org\/10.1007\/s10107-017-1111-1","journal-title":"Math. Program."}],"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-06901-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T23:21:03Z","timestamp":1727306463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06901-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069000","9783031069017"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06901-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 May 2022","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":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ipco2022.com\/home","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":"93","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":"35% - 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":"33","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)"}}]}}