Intersection cuts for polynomial optimization

DOI10.1007/978-3-030-17953-3_6zbMath1436.90101OpenAlexW2943555794MaRDI QIDQ2293083

Chen Chen, Gonzalo Muñoz, Bienstock, Daniel

Publication date: 6 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17953-3_6

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Polynomial optimization (90C23)

Related Items (6)

Maximal Quadratic-Free Sets ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ Towards a characterization of maximal quadratic-free sets ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ Maximal quadratic-free sets

This page was built for publication: Intersection cuts for polynomial optimization