EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
524. Modelling of piece-wise linear concave constraints in continous covering problems
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. | Liding Xu
|
| LIX, École Polytechnique | |
| 2. | Claudia D'Ambrosio
|
| LIX, CNRS - Ecole Polytechnique |
Abstract
We study continuous set covering on networks. The covering condition has a representation as a piece-wise linear concave constraint, which we formulate as a disjunctive system. We propose three MILP reformulations based on indicator constraint, big-M, and disjunctive programming techniques to formulate the disjunctive system. We classify new and old formulations and conduct experiments to compare them.
Keywords
- Mathematical Programming
- Programming, Mixed-Integer
- Programming, Nonlinear
Status: accepted
Back to the list of papers