Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
We study the generalization of split, k-branch split, and intersection cuts from mixed integer linear programming to the realm of mixed integer nonlinear programming. Constructing such cuts requires calculating the convex hull of the difference between a convex set and an open set with a simple geom...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg
2016
|
Online Access: | http://hdl.handle.net/1721.1/103100 https://orcid.org/0000-0003-4335-7248 |