On computing small variable disjunction branch-and-bound trees
From MaRDI portal
Publication:6589747
DOI10.1007/S10107-023-01968-YMaRDI QIDQ6589747FDOQ6589747
Authors: Max Gläser, Marc E. Pfetsch 
Publication date: 20 August 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
Cites Work
- Computational Complexity
- The complexity of computing the permanent
- Branching rules revisited
- On Approximation Algorithms for # P
- The Complexity of Enumeration and Reliability Problems
- On the complexity of \(k\)-SAT
- Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 6th international conference, CPAIOR 2009, Pittsburgh, PA, USA, May 27--31, 2009. Proceedings
- PP is as Hard as the Polynomial-Time Hierarchy
- Estimating the Efficiency of Backtrack Programs
- Title not available (Why is that?)
- Resolution Is Not Automatizable Unless W[P] Is Tractable
- On Interpolation and Automatization for Frege Systems
- Trivial integer programs unsolvable by branch-and-bound
- The complexity of the \(K\)th largest subset problem and related problems
- Proof Complexity
- Lower bounds on the size of general branch-and-bound trees
- Automating resolution is NP-hard
- Title not available (Why is that?)
- An abstract model for branching and its application to mixed integer programming
- Stabbing planes
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- On the complexity of finding shortest variable disjunction branch-and-bound proofs
- Cloud branching
- Estimating the Size of Branch-and-Bound Trees
- Title not available (Why is that?)
This page was built for publication: On computing small variable disjunction branch-and-bound trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589747)
