{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T06:23:00Z","timestamp":1781072580554,"version":"3.54.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031069000","type":"print"},{"value":"9783031069017","type":"electronic"}],"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_7","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:22:30Z","timestamp":1653610950000},"page":"84-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Improving the\u00a0Cook et al. Proximity Bound Given Integral Valued Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3480-4835","authenticated-orcid":false,"given":"Marcel","family":"Celaya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Kuhlmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph","family":"Paat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,5,27]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1137\/20M1353228","volume":"31","author":"I Aliev","year":"2021","unstructured":"Aliev, I., Celaya, M., Henk, M., Williams, A.: Distance-sparsity transference for vertices of corner polyhedra. SIAM J. Optim. 31, 200\u2013126 (2021). https:\/\/doi.org\/10.1137\/20M1353228","journal-title":"SIAM J. Optim."},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Aliev, I., Henk, M., Oertel, T.: Distances to lattice points in knapsack polyhedra. Math. Program. 175\u2013198 (2019). https:\/\/doi.org\/10.1007\/s10107-019-01392-1","DOI":"10.1007\/s10107-019-01392-1"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01582230","volume":"34","author":"W Cook","year":"1986","unstructured":"Cook, W., Gerards, A., Schrijver, A., Tardos, E.: Sensitivity theorems in integer linear programming. Math. Program. 34, 251\u2013264 (1986). https:\/\/doi.org\/10.1007\/BF01582230","journal-title":"Math. Program."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Del Pia, A., Ma, M.: Proximity in concave integer quadratic programming. arXiv:2006.01718 (2021)","DOI":"10.1007\/s10107-021-01655-w"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3340322","volume":"16","author":"F Eisenbrand","year":"2020","unstructured":"Eisenbrand, F., Weismantel, R.: Proximity results and faster algorithms for integer programming using the Steinitz lemma. ACM Trans. Algorithms 16, 1\u201314 (2020). https:\/\/doi.org\/10.1145\/3340322","journal-title":"ACM Trans. Algorithms"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104, 91\u2013104 (2005). https:\/\/doi.org\/10.1007\/s10107-004-0570-3","journal-title":"Math. Program."},{"key":"7_CR7","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, 259\u2013268 (1990). https:\/\/doi.org\/10.1007\/BF01580862","journal-title":"Math. Program."},{"key":"7_CR8","volume-title":"Convex and Discrete Geometry","author":"P Gruber","year":"2007","unstructured":"Gruber, P.: Convex and Discrete Geometry. Springer, Heidelberg (2007)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"DS Hochbaum","year":"1990","unstructured":"Hochbaum, D.S., Shanthikumar, J.G.: Convex separable optimization is not much harder than linear optimization. J. ACM 37, 843\u2013862 (1990). https:\/\/doi.org\/10.1145\/96559.96597","journal-title":"J. ACM"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Jansen, K., Rohwedder, L.: On integer programming and convolution. In: 10th Innovations in Theoretical Computer Science, vol. 43, pp. 43:1\u201343:17 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2019.43","DOI":"10.4230\/LIPIcs.ITCS.2019.43"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","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":"7_CR12","doi-asserted-by":"crossref","unstructured":"Lee, J., Paat, J., Stallknecht, I., Xu, L.: Polynomial upper bounds on the number of differing columns of $$\\Delta $$-modular integer programs. arXiv:2105.08160 (2021)","DOI":"10.1287\/moor.2022.1339"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Mahler, K.: Ein \u00fcbertragungsprinzip f\u00fcr konvexe K\u00f6rper. \u010casopis Pe\u0161t. Mat. Fyz. 68, 93\u2013102 (1939). (in German)","DOI":"10.21136\/CPMF.1939.109441"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"N\u00e4gele, M., Santiago, R., Zenklusen, R.: Congruency-constrained TU problems beyond the bimodular case. In: Proceedings of SODA 2022. arXiv:2109.03148 (2022)","DOI":"10.1137\/1.9781611977073.108"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Oertel, T., Paat, J., Weismantel, R.: The distributions of functions related to parametric integer optimization. SIAM J. Appl. Algebra Geom. 422\u2013440 (2020). https:\/\/doi.org\/10.1137\/19M1275954","DOI":"10.1137\/19M1275954"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Paat, J., Weismantel, R., Weltge, S.: Distances between optimal solutions of mixed-integer programs. Math. Program. 455\u2013468 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1323-z","DOI":"10.1007\/s10107-018-1323-z"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"383","DOI":"10.4007\/annals.2012.176.1.7","volume":"176","author":"F Santos","year":"2012","unstructured":"Santos, F.: A counterexample to the Hirsch Conjecture. Ann. Math. 176, 383\u2013412 (2012). https:\/\/doi.org\/10.4007\/annals.2012.176.1.7","journal-title":"Ann. Math."},{"key":"7_CR18","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.disopt.2008.12.002","volume":"6","author":"S Veselov","year":"2009","unstructured":"Veselov, S., Chirkov, A.: Integer programming with bimodular matrix. Discret. Optim. 6, 220\u2013222 (2009). https:\/\/doi.org\/10.1016\/j.disopt.2008.12.002","journal-title":"Discret. Optim."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01586929","volume":"51","author":"M Werman","year":"1991","unstructured":"Werman, M., Magagnosc, D.: The relationship between integer and real solutions of constrained convex programming. Math. Program. 51, 133\u2013135 (1991). https:\/\/doi.org\/10.1007\/BF01586929","journal-title":"Math. Program."},{"key":"7_CR21","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-030-21803-4_44","volume-title":"Optimization of Complex Systems: Theory, Models, Algorithms and Applications","author":"L Xu","year":"2020","unstructured":"Xu, L., Lee, J.: On proximity for k-regular mixed-integer linear optimization. In: Le Thi, H.A., Le, H.M., Pham Dinh, T. (eds.) WCGO 2019. AISC, vol. 991, pp. 438\u2013447. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-21803-4_44"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T11:44:17Z","timestamp":1675683857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06901-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069000","9783031069017"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06901-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}