{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T21:13:36Z","timestamp":1792790016891,"version":"4.5.0"},"reference-count":129,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["CCF2006587"],"award-info":[{"award-number":["CCF2006587"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA95502010341"],"award-info":[{"award-number":["FA95502010341"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10107-022-01862-z","type":"journal-article","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T13:03:43Z","timestamp":1658495023000},"page":"739-780","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Complexity of optimizing over the integers"],"prefix":"10.1007","volume":"200","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1070-2626","authenticated-orcid":false,"given":"Amitabh","family":"Basu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,22]]},"reference":[{"key":"1862_CR1","doi-asserted-by":"crossref","unstructured":"Abramson, Fred\u00a0G.: Effective computation over the real numbers. In 12th Annual Symposium on Switching and Automata Theory (SWAT 1971), pages 33\u201337. IEEE Computer Society, (1971)","DOI":"10.1109\/SWAT.1971.12"},{"key":"1862_CR2","unstructured":"Aggarwal, Divesh, Dadush, Daniel, Regev, Oded, Stephens-Davidowitz, Noah: Solving the shortest vector problem in 2$$^n$$ time using discrete gaussian sampling. In Proceedings of the forty-seventh annual ACM Symposium on Theory of computing (STOC), pages 733\u2013742. ACM, (2015)"},{"key":"1862_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, Divesh, Dadush, Daniel, Stephens-Davidowitz, Noah: Solving the closest vector problem in 2$$^n$$ time\u2013the discrete gaussian strikes again! In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), pages 563\u2013582. IEEE, (2015)","DOI":"10.1109\/FOCS.2015.41"},{"issue":"1","key":"1862_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/moor.22.1.63","volume":"22","author":"Kurt M Anstreicher","year":"1997","unstructured":"Anstreicher, Kurt M.: On Vaidya\u2019s volumetric cutting plane method for convex programming. Math. Oper. Res. 22(1), 63\u201389 (1997)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"1862_CR5","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.orl.2016.07.004","volume":"44","author":"Stephan Artmann","year":"2016","unstructured":"Artmann, Stephan, Eisenbrand, Friedrich, Glanzer, Christoph, Oertel, Timm, Vempala, Santosh, Weismantel, Robert: A note on non-degenerate integer programs with small sub-determinants. Oper. Res. Lett. 44(5), 635\u2013639 (2016)","journal-title":"Oper. Res. Lett."},{"key":"1862_CR6","doi-asserted-by":"crossref","unstructured":"Artmann, Stephan, Weismantel, Robert, Zenklusen, Rico: A strongly polynomial algorithm for bimodular integer linear programming. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 1206\u20131219. ACM, (2017)","DOI":"10.1145\/3055399.3055473"},{"issue":"1","key":"1862_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1515\/advgeom.2011.028","volume":"12","author":"Gennadiy Averkov","year":"2012","unstructured":"Averkov, Gennadiy, Weismantel, Robert: Transversal numbers over subsets of linear spaces. Adv. Geom. 12(1), 19\u201328 (2012)","journal-title":"Adv. Geom."},{"issue":"3","key":"1862_CR8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02711514","volume":"16","author":"Wojciech Banaszczyk","year":"1996","unstructured":"Banaszczyk, Wojciech: Inequalities for convex bodies and polar reciprocal lattices in $${R}^n$$ II: Application of K-convexity. Discrete & Computational Geometry 16(3), 305\u2013311 (1996)","journal-title":"Discrete & Computational Geometry"},{"issue":"3","key":"1862_CR9","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1287\/moor.24.3.728","volume":"24","author":"Wojciech Banaszczyk","year":"1999","unstructured":"Banaszczyk, Wojciech, Litvak, Alexander E., Pajor, Alain, Szarek, Stanislaw J.: The flatness theorem for nonsymmetric convex bodies via the local theory of Banach spaces. Math. Oper. Res. 24(3), 728\u2013750 (1999)","journal-title":"Math. Oper. Res."},{"key":"1862_CR10","unstructured":"Basu, Amitabh, Conforti, Michele, Di\u00a0Summa, Marco, Jiang, Hongyi: Complexity of cutting plane and branch-and-bound algorithms for mixed-integer optimization. To appear in Mathematical Programming, (2019)"},{"key":"1862_CR11","unstructured":"Basu, Amitabh, Conforti, Michele, Di\u00a0Summa, Marco, Jiang, Hongyi: Complexity of cutting plane and branch-and-bound algorithms for mixed-integer optimization\u2013II. To appear in Combinatorica, (2020)"},{"issue":"1","key":"1862_CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/20M1324521","volume":"31","author":"Amitabh Basu","year":"2021","unstructured":"Basu, Amitabh, Conforti, Michele, Di Summa, Marco, Jiang, Hongyi: Split cuts in the plane. SIAM J. Optim. 31(1), 331\u2013347 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1862_CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1137\/21M139935X","volume":"36","author":"Amitabh Basu","year":"2022","unstructured":"Basu, Amitabh, Jiang, Hongyi: Enumerating integer points in polytopes with bounded subdeterminants. SIAM J. Discret. Math. 36(1), 449\u2013460 (2022)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"1862_CR14","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1137\/16M1092908","volume":"27","author":"Amitabh Basu","year":"2017","unstructured":"Basu, Amitabh, Oertel, Timm: Centerpoints: A link between optimization and convex geometry. SIAM J. Optim. 27(2), 866\u2013889 (2017)","journal-title":"SIAM J. Optim."},{"key":"1862_CR15","doi-asserted-by":"crossref","unstructured":"Basu, Saugata, Pollack, Richard, Roy, Marie-Fran\u00e7oise.: Algorithms in real algebraic geometry. Springer Science & Business Media (2006)","DOI":"10.1007\/3-540-33099-2"},{"key":"1862_CR16","unstructured":"Beame, Paul, Fleming, Noah, Impagliazzo, Russell, Kolokolova, Antonina, Pankratov, Denis, Pitassi, Toniann, Robere, Robert: Stabbing Planes. In Anna\u00a0R. Karlin, editor, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), volume\u00a094 of Leibniz International Proceedings in Informatics (LIPIcs), pages 10:1\u201310:20, Dagstuhl, Germany, (2018). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik"},{"key":"1862_CR17","unstructured":"Beeson, Michael J.: Foundations of constructive mathematics: Metamathematical studies, vol. 6. Springer Science & Business Media, (2012)"},{"issue":"2","key":"1862_CR18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/sapm1977562187","volume":"56","author":"David E Bell","year":"1977","unstructured":"Bell, David E.: A theorem concerning the integer lattice. Stud. Appl. Math. 56(2), 187\u2013188 (1977)","journal-title":"Stud. Appl. Math."},{"key":"1862_CR19","volume-title":"Optimization Over Integers","author":"Dimitris Bertsimas","year":"2005","unstructured":"Bertsimas, Dimitris, Weismantel, Robert: Optimization Over Integers. Dynamic Ideas, Belmont, MA (2005)"},{"key":"1862_CR20","doi-asserted-by":"crossref","unstructured":"Daniel Bienstock, Alberto\u00a0Del Pia, and Robert Hildebrand. Complexity, exactness, and rationality in polynomial optimization. In International Conference on Integer Programming and Combinatorial Optimization, pages 58\u201372. Springer, (2021)","DOI":"10.1007\/978-3-030-73879-2_5"},{"key":"1862_CR21","unstructured":"Bishop, Errett: Foundations of constructive analysis, volume\u00a05. McGraw-Hill New York, (1967)"},{"key":"1862_CR22","doi-asserted-by":"crossref","unstructured":"Bixby, Robert\u00a0E.: A brief history of linear and mixed-integer programming computation. Documenta Mathematica, pages 107\u2013121, (2012)","DOI":"10.4171\/dms\/6\/16"},{"key":"1862_CR23","doi-asserted-by":"crossref","unstructured":"Bixby, Robert\u00a0E., Fenelon, Mary, Gu, Zonghao, Rothberg, Ed, Wunderling, Roland: Mixed integer programming: A progress report. In The Sharpest Cut, pages 309\u2013325. MPS-SIAM Series on Optimization, Philadelphia, PA, (2004)","DOI":"10.1137\/1.9780898718805.ch18"},{"issue":"1","key":"1862_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"Lenore Blum","year":"1989","unstructured":"Blum, Lenore, Shub, Mike, Smale, Steve: On a theory of computation and complexity over the real numbers: W-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc 21(1), 1\u201346 (1989)","journal-title":"Bull. Amer. Math. Soc"},{"issue":"1\u20132","key":"1862_CR25","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0166-218X(99)00156-0","volume":"98","author":"Alexander Bockmayr","year":"1999","unstructured":"Bockmayr, Alexander, Eisenbrand, Friedrich, Hartmann, Mark, Schulz, Andreas S.: On the Chv\u00e1tal rank of polytopes in the 0\/1 cube. Discret. Appl. Math. 98(1\u20132), 21\u201327 (1999)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"1862_CR26","doi-asserted-by":"crossref","first-page":"708","DOI":"10.2307\/2275569","volume":"62","author":"Maria Bonet","year":"1997","unstructured":"Bonet, Maria, Pitassi, Toniann, Raz, Ran: Lower bounds for cutting planes proofs with small coefficients. The Journal of Symbolic Logic 62(3), 708\u2013728 (1997)","journal-title":"The Journal of Symbolic Logic"},{"key":"1862_CR27","volume-title":"The computational complexity of algebraic and numeric problems","author":"Allan Borodin","year":"1975","unstructured":"Borodin, Allan, Munro, Ian: The computational complexity of algebraic and numeric problems. American Elsevier, New York (1975)"},{"issue":"7","key":"1862_CR28","doi-asserted-by":"crossref","first-page":"4709","DOI":"10.1109\/TIT.2017.2701343","volume":"63","author":"G\u00e1bor Braun","year":"2017","unstructured":"Braun, G\u00e1bor., Guzm\u00e1n, Crist\u00f3bal, Pokutta, Sebastian: Lower bounds on the oracle complexity of nonsmooth convex optimization via information theory. IEEE Trans. Inf. Theory 63(7), 4709\u20134724 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1862_CR29","doi-asserted-by":"crossref","unstructured":"Bubeck, S\u00e9bastien: Convex optimization: Algorithms and complexity. arXiv preprint arXiv:1405.4980, (2014)","DOI":"10.1561\/9781601988614"},{"issue":"1","key":"1862_CR30","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01845704","volume":"35","author":"Samuel R Buss","year":"1996","unstructured":"Buss, Samuel R., Clote, Peter: Cutting planes, connectivity, and threshold logic. Arch. Math. Logic 35(1), 33\u201362 (1996)","journal-title":"Arch. Math. Logic"},{"key":"1862_CR31","unstructured":"Carmon, Yair: The Complexity of Optimization beyond Convexity. PhD thesis, Stanford University, August (2020)"},{"issue":"6","key":"1862_CR32","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1287\/opre.28.6.1402","volume":"28","author":"Va\u0161ek Chv\u00e1tal","year":"1980","unstructured":"Chv\u00e1tal, Va.\u0161ek: Hard knapsack problems. Oper. Res. 28(6), 1402\u20131411 (1980)","journal-title":"Oper. Res."},{"key":"1862_CR33","unstructured":"Chv\u00e1tal, Va.\u0161ek: Cutting-plane proofs and the stability number of a graph, Report Number 84326-OR. Universit\u00e4t Bonn, Bonn, Institut f\u00fcr \u00d6konometrie und Operations Research (1984)"},{"key":"1862_CR34","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0024-3795(89)90476-X","volume":"114","author":"Va\u0161ek Chv\u00e1tal","year":"1989","unstructured":"Chv\u00e1tal, Va.\u0161ek, Cook, William J., Hartmann, Mark: On cutting-plane proofs in combinatorial optimization. Linear Algebra Appl. 114, 455\u2013499 (1989)","journal-title":"Linear Algebra Appl."},{"key":"1862_CR35","doi-asserted-by":"crossref","unstructured":"Clote, Peter: Cutting planes and constant depth frege proofs. In Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pages 296\u2013307, (1992)","DOI":"10.1109\/LICS.1992.185542"},{"issue":"1","key":"1862_CR36","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","volume":"18","author":"William J Cook","year":"1987","unstructured":"Cook, William J., Coullard, Collette R., Tur\u00e1n, Gy.: On the complexity of cutting-plane proofs. Discret. Appl. Math. 18(1), 25\u201338 (1987)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"1862_CR37","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/moor.26.1.19.10593","volume":"26","author":"William J Cook","year":"2001","unstructured":"Cook, William J., Dash, Sanjeeb: On the matrix-cut rank of polyhedra. Math. Oper. Res. 26(1), 19\u201330 (2001)","journal-title":"Math. Oper. Res."},{"key":"1862_CR38","first-page":"75","volume":"1","author":"William J Cook","year":"1990","unstructured":"Cook, William J., Hartmann, Mark: On the complexity of branch and cut methods for the traveling salesman problem. Polyhedral Combinatorics 1, 75\u201382 (1990)","journal-title":"Polyhedral Combinatorics"},{"key":"1862_CR39","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"William J Cook","year":"1990","unstructured":"Cook, William J., Kannan, Ravindran, Schrijver, Alexander: Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 47, 155\u2013174 (1990)","journal-title":"Math. Program."},{"key":"1862_CR40","doi-asserted-by":"crossref","unstructured":"Cunningham, William\u00a0H., Geelen, Jim: On integer programming and the branch-width of the constraint matrix. In International Conference on Integer Programming and Combinatorial Optimization, pages 158\u2013166. Springer, (2007)","DOI":"10.1007\/978-3-540-72792-7_13"},{"key":"1862_CR41","unstructured":"Dadush, Daniel: Integer programming, lattice algorithms, and deterministic volume estimation. ProQuest LLC, Ann Arbor, MI, (2012). Thesis (Ph.D.)\u2013Georgia Institute of Technology"},{"key":"1862_CR42","unstructured":"Dadush, Daniel, Tiwari, Samarth: On the complexity of branching proofs. arXiv preprint arXiv:2006.04124, (2020)"},{"key":"1862_CR43","doi-asserted-by":"crossref","unstructured":"Dash, Sanjeeb: An exponential lower bound on the length of some classes of branch-and-cut proofs. In International Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 145\u2013160. Springer, (2002)","DOI":"10.1007\/3-540-47867-1_11"},{"issue":"3","key":"1862_CR44","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1287\/moor.1050.0151","volume":"30","author":"Sanjeeb Dash","year":"2005","unstructured":"Dash, Sanjeeb: Exponential lower bounds on the lengths of some classes of branch-and-cut proofs. Math. Oper. Res. 30(3), 678\u2013700 (2005)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1862_CR45","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.orl.2009.10.010","volume":"38","author":"Sanjeeb Dash","year":"2010","unstructured":"Dash, Sanjeeb: On the complexity of cutting-plane proofs using split cuts. Oper. Res. Lett. 38(2), 109\u2013114 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132","key":"1862_CR46","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10107-013-0654-z","volume":"145","author":"Sanjeeb Dash","year":"2014","unstructured":"Dash, Sanjeeb, Dobbs, Neil B., G\u00fcnl\u00fck, Oktay, Nowicki, Tomasz J., \u015awirszcz, Grzegorz M.: Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming. Math. Program. 145(1\u20132), 483\u2013508 (2014)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1862_CR47","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s10107-012-0542-y","volume":"141","author":"Sanjeeb Dash","year":"2013","unstructured":"Dash, Sanjeeb, G\u00fcnl\u00fck, Oktay: On t-branch split cuts for mixed-integer programs. Math. Program. 141(1\u20132), 591\u2013599 (2013)","journal-title":"Math. Program."},{"key":"1862_CR48","doi-asserted-by":"crossref","unstructured":"De\u00a0Loera, Jes\u00fas\u00a0A.: Raymond Hemmecke, and Matthias K\u00f6ppe. Algebraic and geometric ideas in the theory of discrete optimization. SIAM, (2012)","DOI":"10.1137\/1.9781611972443"},{"issue":"1","key":"1862_CR49","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-017-1178-8","volume":"172","author":"Alberto Del Pia","year":"2018","unstructured":"Del Pia, Alberto: On approximation algorithms for concave mixed-integer quadratic programming. Math. Program. 172(1), 3\u201316 (2018)","journal-title":"Math. Program."},{"issue":"4","key":"1862_CR50","doi-asserted-by":"crossref","first-page":"3154","DOI":"10.1137\/18M121873X","volume":"29","author":"Alberto Del Pia","year":"2019","unstructured":"Del Pia, Alberto: Subdeterminants and concave integer quadratic programming. SIAM J. Optim. 29(4), 3154\u20133173 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1862_CR51","first-page":"225","volume":"162","author":"Alberto Del\u00a0Pia","year":"2017","unstructured":"Del\u00a0Pia, Alberto, Dey, Santanu\u00a0S., Molinaro, Marco: Mixed-integer quadratic programming is in np. Math. Program. 162(1), 225\u2013240 (2017)","journal-title":"Math. Program."},{"key":"1862_CR52","doi-asserted-by":"crossref","unstructured":"Del\u00a0Pia, Alberto, Di\u00a0Gregorio, Silvia: On the complexity of binary polynomial optimization over acyclic hypergraphs. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2684\u20132699. SIAM, (2022)","DOI":"10.1137\/1.9781611977073.105"},{"issue":"2","key":"1862_CR53","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1287\/moor.2015.0738","volume":"41","author":"Alberto Del Pia","year":"2016","unstructured":"Del Pia, Alberto, Hildebrand, Robert, Weismantel, Robert, Zemmer, Kevin: Minimizing cubic and homogeneous polynomials over integers in the plane. Math. Oper. Res. 41(2), 511\u2013530 (2016)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1862_CR54","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/moor.2016.0804","volume":"42","author":"Alberto Del Pia","year":"2017","unstructured":"Del Pia, Alberto, Khajavirad, Aida: A polyhedral study of binary polynomial programs. Math. Oper. Res. 42(2), 389\u2013410 (2017)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1862_CR55","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1137\/16M1095998","volume":"28","author":"Alberto Del Pia","year":"2018","unstructured":"Del Pia, Alberto, Khajavirad, Aida: The multilinear polytope for acyclic hypergraphs. SIAM J. Optim. 28(2), 1049\u20131076 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1862_CR56","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1287\/moor.2021.1121","volume":"46","author":"Alberto Del Pia","year":"2021","unstructured":"Del Pia, Alberto, Khajavirad, Aida: The running intersection relaxation of the multilinear polytope. Math. Oper. Res. 46(3), 1008\u20131037 (2021)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1862_CR57","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s12532-019-00169-z","volume":"12","author":"Alberto Del Pia","year":"2020","unstructured":"Del Pia, Alberto, Khajavirad, Aida, Sahinidis, Nikolaos V.: On the impact of running intersection inequalities for globally solving polynomial optimization problems. Math. Program. Comput. 12(2), 165\u2013191 (2020)","journal-title":"Math. Program. Comput."},{"key":"1862_CR58","doi-asserted-by":"crossref","unstructured":"Del\u00a0Pia, Alberto, Walter, Matthias: Simple odd $$\\beta $$-cycle inequalities for binary polynomial optimization. to appear in Proceedings of IPCO (2022)","DOI":"10.1007\/978-3-031-06901-7_14"},{"key":"1862_CR59","doi-asserted-by":"crossref","unstructured":"Del\u00a0Pia, Alberto, Weismantel, Robert: Integer quadratic programming in the plane. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 840\u2013846, (2014)","DOI":"10.1137\/1.9781611973402.62"},{"key":"1862_CR60","doi-asserted-by":"crossref","unstructured":"Dey, Santanu\u00a0S., Dubey, Yatharth, Molinaro, Marco: Branch-and-bound solves random binary packing IPs in polytime. arXiv preprint arXiv:2007.15192, (2020)","DOI":"10.1137\/1.9781611976465.35"},{"key":"1862_CR61","doi-asserted-by":"crossref","unstructured":"Dey, Santanu\u00a0S., Dubey, Yatharth, Molinaro, Marco: Lower bounds on the size of general branch-and-bound trees. arXiv preprint arXiv:2103.09807, (2021)","DOI":"10.1007\/s10107-022-01781-z"},{"key":"1862_CR62","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01949705","volume":"3","author":"J-P Doignon","year":"1973","unstructured":"Doignon, J.-P.: Convexity in cristallographical lattices. J. Geometry 3, 71\u201385 (1973)","journal-title":"Geometry"},{"key":"1862_CR63","volume-title":"Parameterized Complexity","author":"Rodney G Downey","year":"2012","unstructured":"Downey, Rodney G., Fellows, Michael R.: Parameterized Complexity. Springer Science & Business Media. Berlin\/Heidelberg, Germany (2012)"},{"key":"1862_CR64","doi-asserted-by":"crossref","unstructured":"Eisenbrand, Friedrich: Integer programming and algorithmic geometry of numbers. In M.\u00a0J\u00fcnger, T.\u00a0Liebling, D.\u00a0Naddef, W.\u00a0Pulleyblank, G.\u00a0Reinelt, G.\u00a0Rinaldi, and L.\u00a0Wolsey, editors, 50 Years of Integer Programming 1958\u20132008. Springer-Verlag, (2010)","DOI":"10.1007\/978-3-540-68279-0_14"},{"key":"1862_CR65","unstructured":"Eisenbrand, Friedrich, Hunkenschr\u00f6der, Christoph, Klein, Kim-Manuel, Kouteck\u1ef3, Martin, Levin, Asaf, Onn, Shmuel: An algorithmic theory of integer programming. arXiv preprint arXiv:1904.01361, (2019)"},{"issue":"2","key":"1862_CR66","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s00493-003-0020-5","volume":"23","author":"Friedrich Eisenbrand","year":"2003","unstructured":"Eisenbrand, Friedrich, Schulz, Andreas S.: Bounds on the Chv\u00e1tal rank of polytopes in the 0\/1-cube. Combinatorica 23(2), 245\u2013261 (2003)","journal-title":"Combinatorica"},{"key":"1862_CR67","unstructured":"Fleming, Noah, G\u00f6\u00f6s, Mika, Impagliazzo, Russell, Pitassi, Toniann, Robere, Robert, Tan, Li-Yang, Wigderson, Avi: On the power and limitations of branch and cut. arXiv preprint arXiv:2102.05019, (2021)"},{"key":"1862_CR68","unstructured":"Fomin, Fedor\u00a0V., Panolan, Fahad, Ramanujan, M.\u00a0S., Saurabh, Saket: Fine-grained complexity of integer programming: The case of bounded branch-width and rank. arXiv preprint arXiv:1607.05342, (2016)"},{"issue":"1","key":"1862_CR69","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"Andr\u00e1s Frank","year":"1987","unstructured":"Frank, Andr\u00e1s, Tardos, \u00c9va.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"1862_CR70","doi-asserted-by":"crossref","unstructured":"Friedman, Harvey: Algorithmic procedures, generalized turing algorithms, and elementary recursion theory. In Studies in Logic and the Foundations of Mathematics, volume\u00a061, pages 361\u2013389. Elsevier, (1971)","DOI":"10.1016\/S0049-237X(08)71238-2"},{"key":"1862_CR71","unstructured":"Garey, Michael\u00a0R., Johnson, David\u00a0S.: Computers and intractability. W. H. Freeman and Co., San Francisco, Calif., 1979. A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences"},{"key":"1862_CR72","doi-asserted-by":"crossref","unstructured":"Goerdt, Andreas: Cutting plane versus frege proof systems. In International Workshop on Computer Science Logic, pages 174\u2013194. Springer, (1990)","DOI":"10.1007\/3-540-54487-9_59"},{"key":"1862_CR73","doi-asserted-by":"crossref","unstructured":"Goerdt, Andreas: The cutting plane proof system with bounded degree of falsity. In International Workshop on Computer Science Logic, pages 119\u2013133. Springer, (1991)","DOI":"10.1007\/BFb0023762"},{"issue":"6","key":"1862_CR74","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1007\/s11590-016-1048-y","volume":"10","author":"Dmitry V Gribanov","year":"2016","unstructured":"Gribanov, Dmitry V., Chirkov, Aleksandr Y.: The width and integer optimization on simplices with bounded minors of the constraint matrices. Optimization Letters 10(6), 1179\u20131189 (2016)","journal-title":"Optimization Letters"},{"key":"1862_CR75","unstructured":"Gribanov, Dmitry\u00a0V., Malyshev, Dmitriy\u00a0S., Pardalos, Panos\u00a0M.: A note on the parametric integer programming in the average case: sparsity, proximity, and fpt-algorithms. arXiv preprint arXiv:2002.01307, (2020)"},{"issue":"6","key":"1862_CR76","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1007\/s11590-015-0943-y","volume":"10","author":"Dmitry V Gribanov","year":"2016","unstructured":"Gribanov, Dmitry V., Veselov, Sergey I.: On integer programming with bounded determinants. Optimization Letters 10(6), 1169\u20131177 (2016)","journal-title":"Optimization Letters"},{"key":"1862_CR77","doi-asserted-by":"crossref","unstructured":"Grigoriev, Dima, Hirsch, Edward\u00a0A., Pasechnik, Dmitrii\u00a0V.: Complexity of semi-algebraic proofs. In Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 419\u2013430. Springer, (2002)","DOI":"10.1007\/3-540-45841-7_34"},{"key":"1862_CR78","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, Martin, Lov\u00e1sz, L\u00e1szl\u00f3., Schrijver, Alexander: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics: Study and Research Texts, vol. 2. Springer-Verlag, Berlin (1988)","DOI":"10.1007\/978-3-642-97881-4"},{"key":"1862_CR79","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.2140\/pjm.1960.10.1257","volume":"10","author":"Branko Gr\u00fcnbaum","year":"1960","unstructured":"Gr\u00fcnbaum, Branko: Partitions of mass-distributions and of convex bodies by hyperplanes. Pacific J. Math. 10, 1257\u20131261 (1960)","journal-title":"Pacific J. Math."},{"issue":"4","key":"1862_CR80","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.jco.2005.04.004","volume":"21","author":"Sebastian Heinz","year":"2005","unstructured":"Heinz, Sebastian: Complexity of integer quasiconvex polynomial optimization. J. Complex. 21(4), 543\u2013556 (2005)","journal-title":"J. Complex."},{"key":"1862_CR81","first-page":"175","volume":"32","author":"Eduard Helly","year":"1923","unstructured":"Helly, Eduard: \u00dcber mengen konvexer k\u00f6rper mit gemeinschaftlichen punkte. Jahresber. Deutsch. Math.-Verein. 32, 175\u2013176 (1923)","journal-title":"Jahresber. Deutsch. Math.-Verein."},{"key":"1862_CR82","unstructured":"Hilbert, David: Mathematische probleme. Nachrichten der K\u00f6nigliche Gesellschaft zur Wissenschaften zu G\u00f6ttingen, Mathematische-physikalischen Klasse, vol. 3 (1900)"},{"issue":"1","key":"1862_CR83","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.disopt.2012.11.003","volume":"10","author":"Robert Hildebrand","year":"2013","unstructured":"Hildebrand, Robert, K\u00f6ppe, Matthias: A new lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity $$2^{O(n\\log n)}$$. Discret. Optim. 10(1), 69\u201384 (2013)","journal-title":"Discret. Optim."},{"key":"1862_CR84","doi-asserted-by":"crossref","unstructured":"Hildebrand, Robert, Weismantel, Robert, Zemmer, Kevin: An fptas for minimizing indefinite quadratic forms over integers in polyhedra. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1715\u20131723. SIAM, (2016)","DOI":"10.1137\/1.9781611974331.ch118"},{"key":"1862_CR85","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1111\/j.1749-6632.1979.tb32803.x","volume":"319","author":"Alan J Hoffman","year":"1979","unstructured":"Hoffman, Alan J.: Binding constraints and Helly numbers. Ann. N. Y. Acad. Sci. 319, 284\u2013288 (1979)","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"1862_CR86","doi-asserted-by":"crossref","unstructured":"Impagliazzo, Russell, Pitassi, Toniann, Urquhart, Alasdair: Upper and lower bounds for tree-like cutting planes proofs. In Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, pages 220\u2013228. IEEE, (1994)","DOI":"10.1109\/LICS.1994.316069"},{"key":"1862_CR87","unstructured":"Jansen, Klaus, Rohwedder, Lars: On integer programming, discrepancy, and convolution. arXiv preprint arXiv:1803.04744, (2018)"},{"issue":"1","key":"1862_CR88","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580225","volume":"6","author":"Robert G Jeroslow","year":"1974","unstructured":"Jeroslow, Robert G.: Trivial integer programs unsolvable by branch-and-bound. Math. Program. 6(1), 105\u2013109 (1974)","journal-title":"Math. Program."},{"key":"1862_CR89","doi-asserted-by":"crossref","unstructured":"Jiang, Haotian, Lee, Yin\u00a0Tat, Song, Zhao, Wong, Sam Chiu-wai: An improved cutting plane method for convex optimization, convex-concave games, and its applications. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 944\u2013953, (2020)","DOI":"10.1145\/3357713.3384284"},{"issue":"3","key":"1862_CR90","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"Ravindran Kannan","year":"1987","unstructured":"Kannan, Ravindran: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"1862_CR91","first-page":"1093","volume":"244","author":"Leonid Khachiyan","year":"1979","unstructured":"Khachiyan, Leonid: A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244, 1093\u20131096 (1979)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"2","key":"1862_CR92","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/PL00009496","volume":"23","author":"Leonid Khachiyan","year":"2000","unstructured":"Khachiyan, Leonid, Porkolab, Lorant: Integer optimization on convex semialgebraic sets. Discrete & Computational Geometry 23(2), 207\u2013224 (2000)","journal-title":"Discrete & Computational Geometry"},{"issue":"3","key":"1862_CR93","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3397484","volume":"12","author":"Dusan Knop","year":"2020","unstructured":"Knop, Dusan, Pilipczuk, Michal, Wrochna, Marcin: Tight complexity lower bounds for integer linear programming with few constraints. ACM Transactions on Computation Theory (TOCT) 12(3), 1\u201319 (2020)","journal-title":"ACM Transactions on Computation Theory (TOCT)"},{"key":"1862_CR94","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity theory of real functions","author":"Ker-I Ko","year":"1991","unstructured":"Ko, Ker-I.: Complexity theory of real functions. Boston Inc., Birkhauser (1991)"},{"key":"1862_CR95","doi-asserted-by":"crossref","unstructured":"K\u00f6ppe, Matthias: On the complexity of nonlinear mixed-integer optimization. In Mixed Integer Nonlinear Programming, pages 533\u2013557. Springer, (2012)","DOI":"10.1007\/978-1-4614-1927-3_19"},{"issue":"4","key":"1862_CR96","doi-asserted-by":"crossref","first-page":"1582","DOI":"10.2307\/2586668","volume":"63","author":"Jan Kraj\u00ed\u010dek","year":"1998","unstructured":"Kraj\u00ed\u010dek, Jan: Discretely ordered modules as a first-order extension of the cutting planes proof system. The Journal of Symbolic Logic 63(4), 1582\u20131596 (1998)","journal-title":"The Journal of Symbolic Logic"},{"key":"1862_CR97","doi-asserted-by":"crossref","unstructured":"Lee, Yin\u00a0Tat, Sidford, Aaron, Wong, Sam Chiu-wai: A faster cutting plane method and its implications for combinatorial and convex optimization. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pages 1049\u20131065. IEEE, (2015)","DOI":"10.1109\/FOCS.2015.68"},{"issue":"4","key":"1862_CR98","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"Hendrik W Lenstra Jr","year":"1983","unstructured":"Lenstra, Hendrik W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1862_CR99","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1016\/j.disopt.2008.05.002","volume":"5","author":"Yanjun Li","year":"2008","unstructured":"Li, Yanjun, Richard, Jean-Philippe P.: Cook, Kannan and Schrijver\u2019s example revisited. Discret. Optim. 5(4), 724\u2013734 (2008)","journal-title":"Discret. Optim."},{"key":"1862_CR100","doi-asserted-by":"crossref","unstructured":"Lodi, Andrea: Mixed integer programming computation. In 50 Years of Integer Programming 1958-2008, pages 619\u2013645. Springer, (2010)","DOI":"10.1007\/978-3-540-68279-0_16"},{"key":"1862_CR101","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L\u00e1szl\u00f3: An algorithmic theory of numbers, graphs, and convexity, volume\u00a050. SIAM, (1986)","DOI":"10.1137\/1.9781611970203"},{"issue":"4","key":"1862_CR102","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1287\/ijoc.1120.0524","volume":"25","author":"Susan Margulies","year":"2013","unstructured":"Margulies, Susan, Ma, Jing, Hicks, Illya V.: The cunningham-geelen method in practice: branch-decompositions and integer programming. INFORMS J. Comput. 25(4), 599\u2013610 (2013)","journal-title":"INFORMS J. Comput."},{"key":"1862_CR103","volume-title":"Hilbert\u2019s 10th problem","author":"Yuri Matiyasevich","year":"1993","unstructured":"Matiyasevich, Yuri: Hilbert\u2019s 10th problem. MIT Press, Cambridge, Massachusetts, USA (1993)"},{"key":"1862_CR104","doi-asserted-by":"crossref","unstructured":"Micciancio, Daniele, Voulgaris, Panagiotis: A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations [extended abstract]. In Proceedings of the 2010 ACM International Symposium on Theory of Computing (STOC), pages 351\u2013358. ACM, New York, (2010)","DOI":"10.1145\/1806689.1806739"},{"issue":"3","key":"1862_CR105","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/100811970","volume":"42","author":"Daniele Micciancio","year":"2013","unstructured":"Micciancio, Daniele, Voulgaris, Panagiotis: A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. SIAM J. Comput. 42(3), 1364\u20131391 (2013)","journal-title":"SIAM J. Comput."},{"key":"1862_CR106","unstructured":"Naderi, Mohammad\u00a0Javad, Buchanan, Austin, Walteros, Jose\u00a0L: Worst-case analysis of clique MIPs. http:\/\/www.optimization-online.org\/DB_HTML\/2021\/01\/8198.html, (2021)"},{"key":"1862_CR107","unstructured":"Nemirovski, Arkadii: Efficient methods in convex programming. Lecture notes, (1994)"},{"key":"1862_CR108","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"Arkadii S Nemirovski","year":"1983","unstructured":"Nemirovski, Arkadii S., Yudin, David B.: Problem Complexity and Method Efficiency in Optimization. John Wiley, Hoboken, New Jersey, USA (1983)"},{"key":"1862_CR109","doi-asserted-by":"crossref","unstructured":"Nesterov, Yurii E.: Introductory Lectures on Convex Optimization. Applied Optimization, vol. 87. Kluwer Academic Publishers, Boston (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"1862_CR110","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Yurii E Nesterov","year":"2018","unstructured":"Nesterov, Yurii E.: Lectures on Convex Optimization, vol. 137. Springer, Berlin (2018)"},{"key":"1862_CR111","unstructured":"Oertel, Timm: Integer Convex Minimization in Low Dimensions. PhD thesis, Diss., Eidgen\u00f6ssische Technische Hochschule ETH Z\u00fcrich, Nr. 22288, (2014)"},{"issue":"6\u20137","key":"1862_CR112","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.orl.2014.07.005","volume":"42","author":"Timm Oertel","year":"2014","unstructured":"Oertel, Timm, Wagner, Christian, Weismantel, Robert: Integer convex minimization by mixed integer linear optimization. Oper. Res. Lett. 42(6\u20137), 424\u2013428 (2014)","journal-title":"Oper. Res. Lett."},{"key":"1862_CR113","doi-asserted-by":"crossref","unstructured":"Onn, Shmuel: Nonlinear discrete optimization. Zurich Lectures in Advanced Mathematics, European Mathematical Society, (2010)","DOI":"10.4171\/093"},{"key":"1862_CR114","doi-asserted-by":"crossref","unstructured":"Paat, Joseph, Schl\u00f6ter, Miriam, Weismantel, Robert: The integrality number of an integer program. Mathematical Programming, pages 1\u201321, (2021)","DOI":"10.1007\/s10107-021-01651-0"},{"issue":"4","key":"1862_CR115","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"Christos H Papadimitriou","year":"1981","unstructured":"Papadimitriou, Christos H.: On the complexity of integer programming. Journal of the ACM (JACM) 28(4), 765\u2013768 (1981)","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"1862_CR116","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1090\/S0002-9947-1983-0682717-1","volume":"275","author":"Marian Boykan Pour-El","year":"1983","unstructured":"Pour-El, Marian Boykan, Richards, Ian: Computability and noncomputability in classical analysis. Trans. Am. Math. Soc. 275(2), 539\u2013560 (1983)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"1862_CR117","doi-asserted-by":"crossref","first-page":"981","DOI":"10.2307\/2275583","volume":"62","author":"Pavel Pudl\u00e1k","year":"1997","unstructured":"Pudl\u00e1k, Pavel: Lower bounds for resolution and cutting plane proofs and monotone computations. The Journal of Symbolic Logic 62(3), 981\u2013998 (1997)","journal-title":"The Journal of Symbolic Logic"},{"key":"1862_CR118","doi-asserted-by":"crossref","unstructured":"Pudl\u00e1k, Pavel: On the complexity of the propositional calculus. London Mathematical Society Lecture Note Series, pages 197\u2013218, (1999)","DOI":"10.1017\/CBO9781107325944.010"},{"issue":"4","key":"1862_CR119","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1287\/moor.2016.0840","volume":"42","author":"Alexander A Razborov","year":"2017","unstructured":"Razborov, Alexander A.: On the width of semialgebraic proofs and algorithms. Math. Oper. Res. 42(4), 1106\u20131134 (2017)","journal-title":"Math. Oper. Res."},{"key":"1862_CR120","doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, Thomas, Sanit\u00e0, Laura: 0\/1 polytopes with quadratic Chv\u00e1tal rank. In International Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 349\u2013361. Springer, (2013)","DOI":"10.1007\/978-3-642-36694-9_30"},{"issue":"2","key":"1862_CR121","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1009842406728","volume":"4","author":"Mark Rudelson","year":"2000","unstructured":"Rudelson, Mark: Distances between non-symmetric convex bodies and the $${MM}^*$$-estimate. Positivity 4(2), 161\u2013178 (2000)","journal-title":"Positivity"},{"issue":"9","key":"1862_CR122","doi-asserted-by":"crossref","first-page":"3637","DOI":"10.1073\/pnas.74.9.3637","volume":"74","author":"Herbert E Scarf","year":"1977","unstructured":"Scarf, Herbert E.: An observation on the structure of production sets with indivisibilities. Proc. Natl. Acad. Sci. 74(9), 3637\u20133641 (1977)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1862_CR123","volume-title":"Theory of Linear and Integer Programming","author":"Alexander Schrijver","year":"1986","unstructured":"Schrijver, Alexander: Theory of Linear and Integer Programming. John Wiley and Sons, New York (1986)"},{"key":"1862_CR124","doi-asserted-by":"crossref","unstructured":"Steinitz, Ernst: Bedingt konvergente reihen und konvexe systeme. Journal f\u00fcr die reine und angewandte Mathematik, (1913)","DOI":"10.1515\/crll.1913.143.128"},{"key":"1862_CR125","volume-title":"Information, uncertainty, complexity","author":"Joseph Frederick Traub","year":"1983","unstructured":"Traub, Joseph Frederick, Wasilkowski, Grzegorz W\u0142odzimierz., Wo\u017aniakowski, Henryk: Information, uncertainty, complexity. Addison-Wesley Reading, MA (1983)"},{"issue":"2","key":"1862_CR126","first-page":"544","volume":"43","author":"Alan\u00a0Mathison Turing","year":"1937","unstructured":"Turing, Alan\u00a0Mathison: On computable numbers, with an application to the \u201centscheidungsproblem\u2019\u2019. a correction. Proc. Lond. Math. Soc. 43(2), 544\u2013546 (1937)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"3","key":"1862_CR127","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF02592216","volume":"73","author":"Pravin M Vaidya","year":"1996","unstructured":"Vaidya, Pravin M.: A new algorithm for minimizing convex functions over convex sets. Math. Program. 73(3), 291\u2013341 (1996)","journal-title":"Math. Program."},{"issue":"2","key":"1862_CR128","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.disopt.2008.12.002","volume":"6","author":"Sergey I Veselov","year":"2009","unstructured":"Veselov, Sergey I., Chirkov, Aleksandr J.: Integer program with bimodular matrix. Discret. Optim. 6(2), 220\u2013222 (2009)","journal-title":"Discret. Optim."},{"issue":"2","key":"1862_CR129","first-page":"22","volume":"13","author":"David B Yudin","year":"1976","unstructured":"Yudin, David B., Nemirovskii, Arkadii S.: Informational complexity and efficient methods for the solution of convex extremal problems. Matekon 13(2), 22\u201345 (1976)","journal-title":"Matekon"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01862-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01862-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01862-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T17:56:32Z","timestamp":1727632592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01862-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,22]]},"references-count":129,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1862"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01862-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,22]]},"assertion":[{"value":"8 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}