scientific article; zbMATH DE number 7561762
From MaRDI portal
Publication:5092485
DOI10.4230/LIPIcs.CCC.2020.34MaRDI QIDQ5092485
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/2006.04124
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
integer programmingDiophantine approximationcutting planesTseitin formulasbranching proofsstabbing planes
Related Items
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes ⋮ On the complexity of finding shortest variable disjunction branch-and-bound proofs ⋮ Compressing branch-and-bound trees ⋮ Depth lower bounds in Stabbing Planes for combinatorial principles ⋮ Complexity of optimizing over the integers ⋮ Lower bounds on the size of general branch-and-bound trees ⋮ Unnamed Item ⋮ Propositional proof complexity ⋮ Lower bound on size of branch-and-bound trees for solving lot-sizing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branching on general disjunctions
- On the complexity of cutting-plane proofs
- Column basis reduction and decomposable knapsack problems
- An application of simultaneous diophantine approximation in combinatorial optimization
- Diophantine approximation
- Local branching
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- On the Chvátal-Gomory closure of a compact convex set
- Edmonds polytopes and a hierarchy of combinatorial problems
- A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming
- Integer Programming with a Fixed Number of Variables
- Outline of an algorithm for integer solutions to linear programs
- Discretely ordered modules as a first-order extension of the cutting planes proof system
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Hard Equality Constrained Integer Knapsacks
- Elementary closures for integer programs.
- Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
