How Good Are Sparse Cutting-Planes?

DOI10.1007/978-3-319-07557-0_22zbMath1418.90177arXiv1405.1789OpenAlexW168647200MaRDI QIDQ5419001

Marco Molinaro, Qianyi Wang, Santanu S. Dey

Publication date: 2 June 2014

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (3)

Minimization and maximization versions of the quadratic travelling salesman problem ⋮ Strong IP formulations need large coefficients ⋮ Some lower bounds on sparse outer approximations of polytopes

This page was built for publication: How Good Are Sparse Cutting-Planes?