Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints

Achterberg, 2005, Branching rules revisited, Oper Res Lett, 33, 42, 10.1016/j.orl.2004.04.002

Arroyo, 2006, A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem, IEEE Trans Power Syst, 21, 1371, 10.1109/TPWRS.2006.876672

Arroyo, 2004, Modeling of start-up and shut-down power trajectories of thermal units, IEEE Trans Power Syst, 19, 1562, 10.1109/TPWRS.2004.831654

Atamtürk, 2000, Conflict graphs in solving integer programming problems, Eur J Oper Res, 121, 40, 10.1016/S0377-2217(99)00015-6

Beale, 1970, Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables, OR, 69, 447

Bertacco, 2007, A feasibility pump heuristic for general mixed-integer problems, Discrete Optim, 4, 63, 10.1016/j.disopt.2006.10.001

Bertsimas, 2013, Adaptive robust optimization for the security constrained unit commitment problem, IEEE Trans Power Syst, 28, 52, 10.1109/TPWRS.2012.2205021

Borghetti, 2008, An MILP approach for short-term hydro scheduling and unit commitment with head-dependent reservoir, IEEE Trans Power Syst, 23, 1115, 10.1109/TPWRS.2008.926704

Cheng, 2000, Unit commitment by Lagrangian relaxation and genetic algorithms, IEEE Trans Power Syst, 15, 707, 10.1109/59.867163

Cong G, Meyers C, Rajan D, Parriani T (2015) Parallel strategies for solving large unit commitment problems in the California ISO planning model. In: IEEE parallel and distributed processing symposium (IPDPS), pp 710–719

Damcı-Kurt P, Küçükyavuz S, Rajan, D, Atamtürk A (2013) A polyhedral study of production ramping. Mathematical Programming, pp 1–31

Danna, 2005, Exploring relaxation induced neighborhoods to improve MIP solutions, Math Program Ser A, 102, 71, 10.1007/s10107-004-0518-7

Dubost, 2005, A primal-proximal heuristic applied to the French Unit-commitment problem, Math Program, 104, 129, 10.1007/s10107-005-0593-4

Dupin N (2015) Modélisation et résolution de grands problèmes stochastiques combinatoires: application à la gestion de production d’électricité. Ph.D. thesis Université Lille 1

Fischetti, 2003, Local branching, Math Program, 98, 23, 10.1007/s10107-003-0395-5

Frangioni, 2008, Solving unit commitment problems with general ramp constraints, J Electr Power Energy Syst, 30, 316, 10.1016/j.ijepes.2007.10.003

Frangioni, 2009, Tighter approximated MILP formulations for unit commitment problems, IEEE Trans Power Syst, 24, 105, 10.1109/TPWRS.2008.2004744

Gu, 1998, Lifted cover inequalities for 0-1 integer programs: computation, INFORMS J Comput, 10, 427, 10.1287/ijoc.10.4.427

Lee, 2004, Min-up/min-down polytopes, Discrete Optim, 1, 77, 10.1016/j.disopt.2003.12.001

Lusby, 2013, A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system, J Sched, 16, 605, 10.1007/s10951-012-0310-0

Morales-España G, Latorre JM, Ramos A (2013) Tight and compact MILP formulation for the thermal unit commitment problem. IEEE Trans Power Syst 28(4):4897–4908

Morales-España G, Latorre JM, Ramos A (2013) Tight and compact MILP formulation formulation of start-up and shut-down ramping in unit commitment. IEEE Trans Power Syst 28(2):1288–1296

Morales-España G, Gentile C, Ramos A (2015) Tight MIP formulations of the power-based unit commitment problem. OR Spectrum, pp 1–22

Ostrowski, 2012, Tight mixed integer linear programming formulations for the unit commitment problem, IEEE Trans Power Syst, 27, 39, 10.1109/TPWRS.2011.2162008

Rajan D, Takriti S (2005) Min-up/down polytopes of the unit commitment problem with start-up costs. Tech. rep, IBM Research Report

Renaud, 1993, Daily generation management at Electricité de France: from planning towards real time, IEEE Trans Autom Control, 38, 1080, 10.1109/9.231462

Savelsbergh, 1994, Preprocessing and probing techniques for mixed integer programming problems, ORSA J Comput, 6, 445, 10.1287/ijoc.6.4.445

Takriti, 2000, Incorporating fuel constraints and electricity spot prices into the stochastic unit commitment problem, Oper Res, 48, 268, 10.1287/opre.48.2.268.12379

Vielma, 2015, Mixed integer linear programming formulation techniques, SIAM Rev, 57, 3, 10.1137/130915303

Yıldız, 2013, Incremental and encoding formulations for mixed integer programming, Oper Res Lett, 41, 654, 10.1016/j.orl.2013.09.004