Pages that link to "Item:Q3392019"
From MaRDI portal
The following pages link to Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints (Q3392019):
Displaying 28 items.
- Decomposition algorithm for large-scale two-stage unit-commitment (Q271986) (← links)
- A polyhedral study of production ramping (Q304233) (← links)
- Unit commitment in oligopolistic markets by nonlinear mixed variable programming (Q374676) (← links)
- A hybrid biased random key genetic algorithm approach for the unit commitment problem (Q405676) (← links)
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment (Q486936) (← links)
- Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
- Tight MIP formulations of the power-based unit commitment problem (Q747751) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- An improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem (Q1721218) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- On the complexity of the unit commitment problem (Q1730706) (← links)
- Heuristic solutions to the long-term unit commitment problem with cogeneration plants (Q1761973) (← links)
- Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints (Q2056921) (← links)
- Distributionally robust optimization with multiple time scales: valuation of a thermal power plant (Q2221473) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- Large-scale unit commitment under uncertainty (Q2351161) (← links)
- Tight MIP formulations for bounded up/down times and interval-dependent start-ups (Q2364487) (← links)
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints (Q2397763) (← links)
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming (Q2666655) (← links)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs (Q4995063) (← links)
- A Polyhedral Study on Fuel-Constrained Unit Commitment (Q5060802) (← links)
- Optimal Power Flow in Distribution Networks Under <i>N</i> – 1 Disruptions: A Multistage Stochastic Programming Approach (Q5085985) (← links)
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem (Q5137957) (← links)
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460) (← links)
- Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups (Q6491686) (← links)
