7 citations to https://www.mathnet.ru/eng/mor1
-
Mika Göös, Ilan Newman, Artur Riazanov, Dmitry Sokolov, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 2016
-
Jacobo Torán, Florian Wörz, “Cutting Planes Width and the Complexity of Graph Isomorphism Refutations”, ACM Trans. Comput. Logic, 2024
-
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang, “Complexity of branch-and-bound and cutting planes in mixed-integer optimization”, Math. Program., 198:1 (2023), 787
-
Amitabh Basu, “Complexity of optimizing over the integers”, Math. Program., 200:2 (2023), 739
-
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang, “Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization — II”, Combinatorica, 42:S1 (2022), 971
-
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang, Lecture Notes in Computer Science, 12707, Integer Programming and Combinatorial Optimization, 2021, 383
-
Jan Krajíček, Proof Complexity, 2019