EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2072. M-Decomposable Sets in Integer Programming
Invited abstract in session TC-4: Recent Advances in MINLP, stream MINLP.
Tuesday, 12:30-14:00Room: 1001 (building: 202)
Authors (first author is the speaker)
| 1. | Diego Moran
|
| Industrial and systems engineering, Rensselaer Polytechnic Institute |
Abstract
An M-decomposable set is a closed convex set which is the sum of a compact convex set and a closed convex cone. We present properties of these sets in the context of integer programming. In particular, we present properties of their integer hull, some cutting plane closures and subadditive duality.
Keywords
- Programming, Integer
- Programming, Nonlinear
Status: accepted
Back to the list of papers