scientific article; zbMATH DE number 7561762
From MaRDI portal
Publication:5092485
Cites work
- A \(O(1/\epsilon ^{2})^{n }\)-time sieving algorithm for approximate integer programming
- An application of simultaneous diophantine approximation in combinatorial optimization
- Basis reduction and the complexity of branch-and-bound
- Branching on general disjunctions
- Column basis reduction and decomposable knapsack problems
- Diophantine approximation
- Discretely ordered modules as a first-order extension of the cutting planes proof system
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- Edmonds polytopes and a hierarchy of combinatorial problems
- Elementary closures for integer programs.
- Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
- Hard Equality Constrained Integer Knapsacks
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 2134905 (Why is no real title available?)
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity
- Integer Programming with a Fixed Number of Variables
- Local branching
- Lower bounds for resolution and cutting plane proofs and monotone computations
- On the Chvátal-Gomory closure of a compact convex set
- On the complexity of cutting-plane proofs
- Outline of an algorithm for integer solutions to linear programs
- Stabbing planes
Cited in
(23)- A defense of branching quantification
- The treewidth of proofs
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem
- Proof complexity of monotone branching programs
- On the complexity of finding shortest variable disjunction branch-and-bound proofs
- Lower bounds on the size of general branch-and-bound trees
- A separator theorem for hypergraphs and a CSP-SAT algorithm
- Worst Case Branching and Other Measures of Nondeterminism
- scientific article; zbMATH DE number 7650825 (Why is no real title available?)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes
- Propositional proof complexity
- Compressing branch-and-bound trees
- Depth lower bounds in Stabbing Planes for combinatorial principles
- Complexity of optimizing over the integers
- On the Complexity of Branching Proofs
- On computing small variable disjunction branch-and-bound trees
- Cutting planes width and the complexity of graph isomorphism refutations
- Pseudo-deterministic query complexity of search problems
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Compressing branch-and-bound trees
- On the power and limitations of branch and cut
- Branching with a pre-specified finite list of k-sparse split sets for binary MIPs
- The strength of root cuts in an extended abstract branch-and-cut model
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092485)
