Some lower bounds on sparse outer approximations of polytopes

DOI10.1016/j.orl.2015.03.007zbMath1408.90326arXiv1412.3765MaRDI QIDQ1785369

Marco Molinaro, Santanu S. Dey, Andres Iroume

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.3765

zbMATH Keywords

polytopes; approximation; sparse inequalities

Mathematics Subject Classification ID

52B12: Special polytopes (linear programming, centrally symmetric, etc.)

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

Related Items

Approximation of convex bodies by multiple objective optimization and an application in reachable sets, Beating the SDP bound for the floor layout problem: a simple combinatorial idea, Approximating polyhedra with sparse inequalities, Theoretical challenges towards cutting-plane selection, Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, Sparsity of integer formulations for binary programs

Cites Work

• Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
• How Good Are Sparse Cutting-Planes?
• Unnamed Item
• Unnamed Item