P. Bendotti, P. Fouilhoux, and C. Rottner, On the complexity of the unit commitment problem, Optimization Online, 2017.

P. Bendotti, P. Fouilhoux, and C. Rottner, The min-up/min-down unit commitment polytope, Journal of Combinatorial Optimization, vol.68, issue.2
DOI : 10.1016/j.ijepes.2014.12.054

T. Berthold, E. Marc, and . Pfetsch, Detecting Orbitopal Symmetries, Operations Research Proceedings, pp.433-438, 2008.
DOI : 10.1007/978-3-642-00142-0_70

R. Borndörfer, M. Grötschel, and M. E. Pfetsch, A Column-Generation Approach to Line Planning in Public Transport, Transportation Science, vol.41, issue.1, pp.123-132, 2007.
DOI : 10.1287/trsc.1060.0161

M. Carrion and J. M. Arroyo, A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem, IEEE Transactions on Power Systems, vol.21, issue.3, 2006.
DOI : 10.1109/TPWRS.2006.876672

E. J. Friedman, Fundamental Domains for Integer Programs with Symmetries, pp.146-153, 2007.
DOI : 10.1007/978-3-540-73556-4_17

P. Ian, T. Gent, . Kelsey, A. Stephen, J. Linton et al., Groupoids and conditional symmetry, Proc. 9th International Conference on Principles and Practice of Constraint Programming, pp.823-830, 2007.

A. Gleixner, L. Eifler, T. Gally, G. Gamrath, P. Gemander et al., The scip optimization suite 5.0, 2017.

C. Hojny and M. E. Pfetsch, Polytopes associated with symmetry handling. Optimization Online, 2017.
DOI : 10.1007/s10107-018-1239-7

V. Kaibel and A. Loos, Branched Polyhedral Systems, Proceedings of the 14th International IPCO Conference on Integer Programming and Combinatorial Optimization, 2010.
DOI : 10.1007/978-3-642-13036-6_14

V. Kaibel, M. Peinhardt, and M. E. Pfetsch, Orbitopal fixing, IPCO, pp.74-88, 2007.
DOI : 10.1007/978-3-540-72792-7_7

V. Kaibel and M. Pfetsch, Packing and partitioning orbitopes, Mathematical Programming, pp.1-36, 2008.
DOI : 10.1007/978-3-642-78240-4
URL : http://arxiv.org/pdf/math/0603678

L. Liberti and J. Ostrowski, Stabilizer-based symmetry breaking constraints for mathematical programs, Journal of Global Optimization, vol.47, issue.10, pp.183-194, 2014.
DOI : 10.1287/mnsc.47.10.1396.10265
URL : http://www.lix.polytechnique.fr/~liberti/sbstab.pdf

L. Liberti, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Mathematical Programming, pp.273-304, 2012.
DOI : 10.1016/j.amc.2005.05.025
URL : http://www.lix.polytechnique.fr/%7Eliberti/minlpgroup.pdf

A. Loos, Describing Orbitopes by Linear Inequalities and Projection Based Tools, 2011.

F. Margot, Pruning by isomorphism in Branch-and-Cut, Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization, pp.304-317, 2001.
DOI : 10.1007/s10107-002-0358-2
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=1275&context=tepper

F. Margot, Exploiting orbits in symmetric ILP, Mathematical Programming, pp.3-21, 2003.
DOI : 10.1007/s10107-003-0394-6
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.215.3513&rep=rep1&type=pdf

J. Ostrowski, Symmetry in integer programming, 2008.

J. Ostrowski, M. F. Anjos, and A. Vannelli, Modified orbital branching for structured symmetry with an application to unit commitment, Mathematical Programming, pp.99-129, 2015.
DOI : 10.1109/TPWRS.2002.805003

M. Pfetsch and T. Rehn, A computational comparison of symmetry handling methods for mixed integer programs. Optimization Online, 2015.

D. Rajan and S. Takriti, Minimum up/down polytopes of the unit commitment problem with start-up costs, 2005.