Approximation of corner polyhedra with families of intersection cuts
From MaRDI portal
Publication:2401144
DOI10.1007/978-3-319-59250-3_5zbMath1418.90171arXiv1705.02015OpenAlexW2613478517MaRDI QIDQ2401144
Gennadiy Averkov, Joseph Paat, Amitabh Basu
Publication date: 31 August 2017
Full work available at URL: https://arxiv.org/abs/1705.02015
Related Items (4)
Theoretical challenges towards cutting-plane selection ⋮ Can Cut-Generating Functions Be Good and Efficient? ⋮ Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs ⋮ The strength of multi-row aggregation cuts for sign-pattern integer programs
This page was built for publication: Approximation of corner polyhedra with families of intersection cuts
