Cited By
View all- Gläser MPfetsch M(2024)On computing small variable disjunction branch-and-bound treesMathematical Programming: Series A and B10.1007/s10107-023-01968-y206:1-2(145-173)Online publication date: 1-Jul-2024
- Gläser MPfetsch M(2022)On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound ProofsInteger Programming and Combinatorial Optimization10.1007/978-3-031-06901-7_22(291-304)Online publication date: 27-Jun-2022
- de Rezende SGöös MNordström JPitassi TRobere RSokolov DKhuller SVassilevska Williams V(2021)Automating algebraic proof systems is NP-hardProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451080(209-222)Online publication date: 15-Jun-2021
- Show More Cited By