Cutting planes cannot approximate some integer programs
From MaRDI portal
(Redirected from Publication:453048)
Recommendations
Cites work
- scientific article; zbMATH DE number 4008289 (Why is no real title available?)
- Approximating maximum independent sets by excluding subgraphs
- Boolean function complexity. Advances and frontiers.
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Combinatorics of monotone computations
- Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
- Lower bounds for cutting planes proofs with small coefficients
- Lower bounds for resolution and cutting plane proofs and monotone computations
- On cutting-plane proofs in combinatorial optimization
- On the complexity of cutting-plane proofs
- On the complexity of cutting-plane proofs using split cuts
- The monotone circuit complexity of Boolean functions
- The resolution complexity of independent sets and vertex covers in random graphs
Cited in
(4)
This page was built for publication: Cutting planes cannot approximate some integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453048)