Small and strong formulations for unions of convex sets from the Cayley embedding
There is often a significant trade-off between formulation strength and size in mixed integer programming (MIP). When modelling convex disjunctive constraints (e.g. unions of convex sets) this trade-off can be resolved by adding auxiliary continuous variables. However, adding these variables can res...
Main Author: | |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Springer Nature America, Inc,
2019-03-19T16:14:54Z.
|
Subjects: | |
Online Access: | Get fulltext |