{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T22:50:00Z","timestamp":1772837400052,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031598340","type":"print"},{"value":"9783031598357","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-59835-7_33","type":"book-chapter","created":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:05:03Z","timestamp":1716275103000},"page":"446-459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sensitivity Analysis for\u00a0Mixed Binary Quadratic Programming"],"prefix":"10.1007","author":[{"given":"Diego","family":"Cifuentes","sequence":"first","affiliation":[]},{"given":"Santanu S.","family":"Dey","sequence":"additional","affiliation":[]},{"given":"Jingye","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","unstructured":"Anstreicher, K.M.: Testing copositivity via mixed-integer linear programming. Linear Algebra Appl. 609, 218\u2013230 (2021). https:\/\/doi.org\/10.1016\/j.laa.2020.09.002. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379520304171","DOI":"10.1016\/j.laa.2020.09.002"},{"issue":"2","key":"33_CR2","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1287\/ijoc.2021.1108","volume":"34","author":"R Badenbroek","year":"2022","unstructured":"Badenbroek, R., de Klerk, E.: An analytic center cutting plane method to determine complete positivity of a matrix. INFORMS J. Comput. 34(2), 1115\u20131125 (2022)","journal-title":"INFORMS J. Comput."},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., De Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Glob. Optim. 24, 163\u2013185 (2002)","journal-title":"J. Glob. Optim."},{"key":"33_CR4","unstructured":"Brown, R., Neira, D.E.B., Venturelli, D., Pavone, M.: Copositive programming for mixed-binary quadratic optimization via Ising solvers. arXiv preprint arXiv:2207.13630 (2022)"},{"issue":"2","key":"33_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120(2), 479\u2013495 (2009). https:\/\/doi.org\/10.1007\/s10107-008-0223-z","journal-title":"Math. Program."},{"issue":"3","key":"33_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.orl.2012.02.001","volume":"40","author":"S Burer","year":"2012","unstructured":"Burer, S., Dong, H.: Representing quadratically constrained quadratic programs as generalized copositive programs. Oper. Res. Lett. 40(3), 203\u2013206 (2012)","journal-title":"Oper. Res. Lett."},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-031-06901-7_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Celaya","year":"2022","unstructured":"Celaya, M., Kuhlmann, S., Paat, J., Weismantel, R.: Improving the Cook et al. proximity bound given integral valued constraints. In: Aardal, K., Sanit\u00e1, L. (eds.) IPCO 2022. LNCS, vol. 13265, pp. 84\u201397. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06901-7_7"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-11008-0_2","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer programming models. In: Conforti, M., Cornu\u00e9jols, G., Zambelli, G. (eds.) Integer Programming. GTM, vol. 271, pp. 45\u201384. Springer, Cham Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-11008-0_2"},{"issue":"3","key":"33_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01582230","volume":"34","author":"W Cook","year":"1986","unstructured":"Cook, W., Gerards, A.M.H., Schrijver, A., Tardos, \u00c9.: Sensitivity theorems in integer linear programming. Math. Program. 34(3), 251\u2013264 (1986). https:\/\/doi.org\/10.1007\/BF01582230","journal-title":"Math. Program."},{"issue":"1\u20132","key":"33_CR10","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1007\/s10107-021-01655-w","volume":"194","author":"A Del Pia","year":"2022","unstructured":"Del Pia, A., Ma, M.: Proximity in concave integer quadratic programming. Math. Program. 194(1\u20132), 871\u2013900 (2022)","journal-title":"Math. Program."},{"issue":"1","key":"33_CR11","first-page":"1","volume":"16","author":"F Eisenbrand","year":"2019","unstructured":"Eisenbrand, F., Weismantel, R.: Proximity results and faster algorithms for integer programming using the Steinitz lemma. ACM Trans. Algorithms (TALG) 16(1), 1\u201314 (2019)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-016-1012-8","volume":"161","author":"MJ Feizollahi","year":"2017","unstructured":"Feizollahi, M.J., Ahmed, S., Sun, A.: Exact augmented Lagrangian duality for mixed integer linear programming. Math. Program. 161, 365\u2013387 (2017)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"33_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01580862","volume":"47","author":"F Granot","year":"1990","unstructured":"Granot, F., Skorin-Kapov, J.: Some proximity and sensitivity results in quadratic integer programming. Math. Program. 47(1\u20133), 259\u2013268 (1990)","journal-title":"Math. Program."},{"issue":"1","key":"33_CR14","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1137\/19M1271695","volume":"30","author":"X Gu","year":"2020","unstructured":"Gu, X., Ahmed, S., Dey, S.S.: Exact augmented Lagrangian duality for mixed integer quadratic programming. SIAM J. Optim. 30(1), 781\u2013797 (2020)","journal-title":"SIAM J. Optim."},{"key":"33_CR15","unstructured":"Gu, X., Dey, S.S., Xavier, \u00c1.S., Qiu, F.: Exploiting instance and variable similarity to improve learning-enhanced branching. arXiv preprint arXiv:2208.10028 (2022)"},{"key":"33_CR16","unstructured":"Guo, C., Bodur, M., Taylor, J.A.: Copositive duality for discrete energy markets (2021)"},{"key":"33_CR17","unstructured":"Johnson, E.S., Ahmed, S., Dey, S.S., Watson, J.P.: A K-nearest neighbor heuristic for real-time DC optimal transmission switching. arXiv preprint arXiv:2003.10565 (2020)"},{"key":"33_CR18","unstructured":"Kim, S., Kojima, M.: Strong duality of a conic optimization problem with a single hyperplane and two cone constraints. arXiv preprint arXiv:2111.03251 (2021)"},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-53262-8_10","volume-title":"Combinatorial Optimization","author":"J Lee","year":"2020","unstructured":"Lee, J., Paat, J., Stallknecht, I., Xu, L.: Improving proximity bounds using sparsity. In: Ba\u00efou, M., Gendron, B., G\u00fcnl\u00fck, O., Mahjoub, A.R. (eds.) ISCO 2020. LNCS, vol. 12176, pp. 115\u2013127. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53262-8_10"},{"key":"33_CR20","unstructured":"Linderoth, J., Raghunathan, A.: Completely positive reformulations and cutting plane algorithms for mixed integer quadratic programs. INFORMS Annual Meeting (2022)"},{"key":"33_CR21","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1146\/annurev-control-091819-074326","volume":"3","author":"A Majumdar","year":"2020","unstructured":"Majumdar, A., Hall, G., Ahmadi, A.A.: Recent scalability improvements for semidefinite programming with applications in machine learning, control, and robotics. Ann. Rev. Control Robot. Auton. Syst. 3, 331\u2013360 (2020)","journal-title":"Ann. Rev. Control Robot. Auton. Syst."},{"key":"33_CR22","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization, vol. 55. Wiley, Hoboken (1999)"},{"key":"33_CR23","volume-title":"Market Operations in Electric Power Systems: Forecasting, Scheduling, and Risk Management","author":"M Shahidehpour","year":"2003","unstructured":"Shahidehpour, M., Yamin, H., Li, Z.: Market Operations in Electric Power Systems: Forecasting, Scheduling, and Risk Management. Wiley, Hoboken (2003)"},{"key":"33_CR24","doi-asserted-by":"publisher","unstructured":"Vavasis, S.A.: Quadratic programming is in NP. Inf. Process. Lett. 36(2), 73\u201377 (1990). https:\/\/doi.org\/10.1016\/0020-0190(90)90100-C. https:\/\/www.sciencedirect.com\/science\/article\/pii\/002001909090100C","DOI":"10.1016\/0020-0190(90)90100-C"},{"issue":"2","key":"33_CR25","first-page":"739","volume":"33","author":"\u00c1S Xavier","year":"2021","unstructured":"Xavier, \u00c1.S., Qiu, F., Ahmed, S.: Learning to solve large-scale security-constrained unit commitment problems. INFORMS J. Comput. 33(2), 739\u2013756 (2021)","journal-title":"INFORMS J. Comput."}],"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-59835-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:14:52Z","timestamp":1716275692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-59835-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031598340","9783031598357"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-59835-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","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":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco2024.ii.uni.wroc.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}