Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Cécile Rottner"'
Autor:
Alexandre Heintzmann, Christian Artigues, Pascale Bendotti, Sandra Ulrich Ngueveu, Cécile Rottner
A wide range of real world optimization problems involves continuous decisions and non-linearities. Each non-linear component of such problems can be modeled either linearly or non-linearly, considering or not additional integer variables. This resul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f523fb8e444132bff54d7b290496d6f6
https://hal.science/hal-03739677v2/file/Article_non_lineaire_hal.pdf
https://hal.science/hal-03739677v2/file/Article_non_lineaire_hal.pdf
Autor:
Cécile Rottner
Consider a time horizon and a set of possible states for a given system. The system must be in exactly one state at a time. In this paper, we generalize classical results on min-up/min-down constraints for a 2-state system to an n-state system. The m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::004c30edaea3f596e541440c1dcca5b1
https://hal-edf.archives-ouvertes.fr/hal-03938035
https://hal-edf.archives-ouvertes.fr/hal-03938035
Publikováno v:
Mathematical Programming
Mathematical Programming, Springer Verlag, 2020, 183 (1-2), pp.61-103. ⟨10.1007/s10107-020-01491-4⟩
Mathematical Programming, Springer Verlag, 2020, 183 (1-2), pp.61-103. ⟨10.1007/s10107-020-01491-4⟩
International audience; We consider integer linear programs whose solutions are binary matrices and whose (sub-)symmetry groups are symmetric groups acting on (sub-)columns. Such structured sub-symmetry groups arise in important classes of combinator
Publikováno v:
Lecture Notes in Computer Science
The 20th Conference on Integer Programming and Combinatorial Optimization May 22–24, 2019, Ann Arbor, Michigan, USA
IPCO 2019-20th Conference on Integer Programming and Combinatorial Optimization
IPCO 2019-20th Conference on Integer Programming and Combinatorial Optimization, May 2019, Ann Arbor, Michigan, United States. pp.57-71, ⟨10.1007/978-3-030-17953-3_5⟩
Mathematical Programming B
Integer Programming and Combinatorial Optimization ISBN: 9783030179526
IPCO
The 20th Conference on Integer Programming and Combinatorial Optimization May 22–24, 2019, Ann Arbor, Michigan, USA
IPCO 2019-20th Conference on Integer Programming and Combinatorial Optimization
IPCO 2019-20th Conference on Integer Programming and Combinatorial Optimization, May 2019, Ann Arbor, Michigan, United States. pp.57-71, ⟨10.1007/978-3-030-17953-3_5⟩
Mathematical Programming B
Integer Programming and Combinatorial Optimization ISBN: 9783030179526
IPCO
International audience; We consider integer linear programs whose solutions are binary matrices and whose (sub-)symmetry groups are symmetric groups acting on (sub-)columns. We propose a framework to build (sub-)symmetry-breaking inequalities for suc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58bc986a0cc946428e909518a808cb95
https://hal.archives-ouvertes.fr/hal-01876358
https://hal.archives-ouvertes.fr/hal-01876358
Publikováno v:
Annals of Operations Research
Annals of Operations Research, Springer Verlag, 2019, 274 (1-2), pp.119-130. ⟨10.1007/s10479-018-2827-x⟩
Annals of Operations Research, Springer Verlag, 2019, 274 (1-2), pp.119-130. ⟨10.1007/s10479-018-2827-x⟩
This article analyzes how the Unit Commitment Problem (UCP) complexity evolves with respect to the number n of units and T of time periods. A classical reduction from the knapsack problem shows that the UCP is NP-hard in the ordinary sense even for $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::32b89a0205677c4f6fefb1560c50e15f
https://hal.archives-ouvertes.fr/hal-02074569
https://hal.archives-ouvertes.fr/hal-02074569
Publikováno v:
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization, Springer Verlag, 2018, 36 (3), pp.1024-1058. ⟨10.1007/s10878-018-0273-y⟩
Journal of Combinatorial Optimization, Springer Verlag, 2018, 36 (3), pp.1024-1058. ⟨10.1007/s10878-018-0273-y⟩
The min-up/min-down unit commitment problem (MUCP) is to find a minimum-cost production plan on a discrete time horizon for a set of fossil-fuel units for electricity production. At each time period, the total production has to meet a forecast demand
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::961e93fcf03cbbfdd0d8fde8c533ab1a
https://hal.archives-ouvertes.fr/hal-02074580
https://hal.archives-ouvertes.fr/hal-02074580
Publikováno v:
HAL
ISMP International Conference on Mathematical Programming (ISMP 2018)
ISMP International Conference on Mathematical Programming (ISMP 2018), Jul 2018, Bordeaux, France
ISMP International Conference on Mathematical Programming (ISMP 2018)
ISMP International Conference on Mathematical Programming (ISMP 2018), Jul 2018, Bordeaux, France
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f10ca64d6ef6bb772912e1a22167ad96
https://hal.sorbonne-universite.fr/hal-01822210
https://hal.sorbonne-universite.fr/hal-01822210
This paper focuses on integer linear programs where solutions are binary matrices, and the corresponding symmetry group is the set of all column permutations. Orbitopal fixing, as introduced by Kaibel et al., is a technique designed to break symmetri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f025c7d7e2c8f16931f67063b67c56a
http://arxiv.org/abs/1710.10189
http://arxiv.org/abs/1710.10189
Publikováno v:
ROADEF-18ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision
ROADEF-18ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Feb 2017, Metz, France
HAL
ROADEF-18ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Feb 2017, Metz, France
HAL
National audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ae92db9279e65532a780ebabde355a21
https://hal.archives-ouvertes.fr/hal-01545602
https://hal.archives-ouvertes.fr/hal-01545602