The following pages link to Min-up/min-down polytopes (Q2386215):
Displaying 28 items.
- A polyhedral study of production ramping (Q304233) (← links)
- A deterministic method for the unit commitment problem in power systems (Q342197) (← links)
- Mixed integer linear models for the optimization of dynamical transport networks (Q634782) (← links)
- Combinatorial integral approximation (Q634784) (← 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)
- The min-up/min-down unit commitment polytope (Q1631659) (← links)
- Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints (Q2044970) (← links)
- Mixed-integer optimal control under minimum dwell time constraints (Q2044975) (← links)
- Exploiting complete linear descriptions for decentralized power market problems with integralities (Q2155382) (← links)
- Tight MIP formulations for bounded up/down times and interval-dependent start-ups (Q2364487) (← links)
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints (Q2397760) (← links)
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints (Q2397763) (← links)
- Weekly self-scheduling, forward contracting, and pool involvement for an electricity producer. An adaptive robust optimization approach (Q2629650) (← links)
- On Vertices and Facets of Combinatorial 2-Level Polytopes (Q2835675) (← links)
- The Lagrangian relaxation for the combinatorial integral approximation problem (Q2943809) (← links)
- Polytopal balls arising in optimization (Q3391332) (← links)
- Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services (Q4995076) (← links)
- Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems (Q4995099) (← links)
- A Polyhedral Study on Fuel-Constrained Unit Commitment (Q5060802) (← links)
- Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets (Q5087741) (← links)
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem (Q5137957) (← links)
- On Mixed-Integer Programming Formulations for the Unit Commitment Problem (Q5148170) (← links)
- Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
- Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings (Q6065894) (← links)
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints (Q6088241) (← links)
- The polytope of binary sequences with bounded variation (Q6108928) (← links)
- Parabolic optimal control problems with combinatorial switching constraints. I: Convex relaxations (Q6490311) (← links)
