Some lower bounds on sparse outer approximations of polytopes

DOI10.1016/j.orl.2015.03.007zbMath1408.90326arXiv1412.3765OpenAlexW2074585631MaRDI 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

polytopesapproximationsparse inequalities

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (7)

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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?

This page was built for publication: Some lower bounds on sparse outer approximations of polytopes