4.4 Article

Polynomial time algorithms and extended formulations for unit commitment problems

Related references

Note: Only part of the references are listed.
Article Computer Science, Software Engineering

Tight MIP formulations for bounded up/down times and interval-dependent start-ups

Maurice Queyranne et al.

MATHEMATICAL PROGRAMMING (2017)

Article Computer Science, Software Engineering

A polyhedral study of production ramping

Pelin Damci-Kurt et al.

MATHEMATICAL PROGRAMMING (2016)

Article Computer Science, Software Engineering

Cutting planes for the multistage stochastic unit commitment problem

Ruiwei Jiang et al.

MATHEMATICAL PROGRAMMING (2016)

Article Engineering, Electrical & Electronic

Metaheuristic search based methods for unit commitment

Dewan Fayzur Rahman et al.

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS (2014)

Article Computer Science, Interdisciplinary Applications

A hybrid biased random key genetic algorithm approach for the unit commitment problem

L. A. C. Roque et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2014)

Article Operations Research & Management Science

A decomposition approach to the two-stage stochastic unit commitment problem

Qipeng P. Zheng et al.

ANNALS OF OPERATIONS RESEARCH (2013)

Article Engineering, Electrical & Electronic

Solution of unit commitment problem using gravitational search algorithm

Provas Kumar Roy

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS (2013)

Article Engineering, Electrical & Electronic

A new MILP-based approach for unit commitment in power production planning

Ana Viana et al.

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS (2013)

Review Energy & Fuels

A solution to the unit commitment problem-a review

B. Saravanan et al.

FRONTIERS IN ENERGY (2013)

Article Engineering, Electrical & Electronic

Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem

James Ostrowski et al.

IEEE TRANSACTIONS ON POWER SYSTEMS (2012)

Article Engineering, Electrical & Electronic

Tight polyhedral approximation for mixed-integer linear programming unit commitment formulations

R. A. Jabr

IET GENERATION TRANSMISSION & DISTRIBUTION (2012)

Article Engineering, Electrical & Electronic

A Tighter Piecewise Linear Approximation of Quadratic Cost Curves for Unit Commitment Problems

Lei Wu

IEEE TRANSACTIONS ON POWER SYSTEMS (2011)

Article Engineering, Electrical & Electronic

Tighter Approximated MILP Formulations for Unit Commitment Problems

Antonio Frangioni et al.

IEEE TRANSACTIONS ON POWER SYSTEMS (2009)

Article Engineering, Electrical & Electronic

Fast SCUC for large-scale power systems

Yong Fu et al.

IEEE TRANSACTIONS ON POWER SYSTEMS (2007)

Article Engineering, Electrical & Electronic

A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem

Miguel Carrion et al.

IEEE TRANSACTIONS ON POWER SYSTEMS (2006)

Article Management

Solving nonlinear single-unit commitment problems with ramping constraints

Antonio Frangioni et al.

OPERATIONS RESEARCH (2006)

Review Engineering, Electrical & Electronic

Unit commitment - A bibliographical survey

NP Padhy

IEEE TRANSACTIONS ON POWER SYSTEMS (2004)

Article Engineering, Electrical & Electronic

Price maker self-scheduling in a pool-based electricity market: A mixed-integer LP approach

S de la Torre et al.

IEEE TRANSACTIONS ON POWER SYSTEMS (2002)

Article Engineering, Electrical & Electronic

Unit commitment solution methodology using genetic algorithm

KS Swarup et al.

IEEE TRANSACTIONS ON POWER SYSTEMS (2002)

Article Engineering, Electrical & Electronic

Unit commitment by Lagrangian relaxation and genetic algorithms

CP Cheng et al.

IEEE TRANSACTIONS ON POWER SYSTEMS (2000)