Intersection cuts for nonlinear integer programming: convexification techniques for structured sets

DOI10.1007/s10107-015-0866-5zbMath1358.90078arXiv1302.2556MaRDI QIDQ5962729

Sina Modaresi, Mustafa R. Kılınç, Juan Pablo Vielma

Publication date: 23 February 2016

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

mixed integer nonlinear programming; \(k\)-branch split; aggregation technique; conic quadratic sets; interpolation technique; intersection cuts; split

Mathematics Subject Classification ID

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

Uses Software

• SCIP