Intersection cuts for factorable MINLP

DOI10.1007/978-3-030-17953-3_29zbMath1436.90091arXiv1812.03073OpenAlexW2904095812MaRDI QIDQ2293096

Felipe Serrano

Publication date: 6 February 2020

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

zbMATH Keywords

intersection cutsmixed-integer nonlinear programmingmonoidal strengthening

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (8)

Maximal Quadratic-Free Sets ⋮ Optimization conditions and decomposable algorithms for convertible nonconvex optimization ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ On a generalization of the Chvátal-Gomory closure ⋮ Maximal quadratic-free sets

This page was built for publication: Intersection cuts for factorable MINLP