Pages that link to "Item:Q2082175"
From MaRDI portal
The following pages link to Fast computation of global solutions to the single-period unit commitment problem (Q2082175):
Displaying 4 items.
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem (Q2227540) (← links)
- A polynomial-time algorithm with tight error bounds for single-period unit commitment problem (Q2687676) (← links)
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters (Q2693785) (← links)
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints (Q3392019) (← links)