EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3903. Structured (sub-)symmetry breaking in MILP by variable aggregation
Invited abstract in session WC-25: Topics in Combinatorial Optimization I (Contributed), stream Combinatorial Optimization.
Wednesday, 12:30-14:00Room: 011 (building: 208)
Authors (first author is the speaker)
| 1. | Cecile Rottner
|
| EDF R&D |
Abstract
MILP resolution is strongly impacted by symmetries, namely the existence of solutions identical up to a permutation. In this presentation, we focus on MILP with structured symmetries, ie any column permutation of the solution matrix is a symmetry. Various types of symmetry-breaking techniques exist to handle such symmetries, from specialized branching disjunctions, lexicographic ordering or symmetric variables aggregation. We focus on the latter technique which has shown to be very efficient on problems with specific structure, namely featuring the disaggregation property. We study in which case the aggregation technique can be used and how to benefit from its efficiency in more general cases. Case studies on variants of the Unit Commitment problems are proposed.
Keywords
- Combinatorial Optimization
- Programming, Integer
- Polyhedral Combinatorics
Status: accepted
Back to the list of papers