Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
From MaRDI portal
Recommendations
- On Mixed-Integer Programming Formulations for the Unit Commitment Problem
- Fast computation of global solutions to the single-period unit commitment problem
- Large-scale unit commitment under uncertainty
- Online Mixed-Integer Optimization in Milliseconds
- Cutting planes for the multistage stochastic unit commitment problem
Cites work
- scientific article; zbMATH DE number 6317138 (Why is no real title available?)
- A machine learning-based approximation of strong branching
- A polyhedral study of production ramping
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
- Empirical decision model learning
- JuMP: a modeling language for mathematical optimization
- Julia: a fresh approach to numerical computing
- Learning MILP resolution outcomes before reaching time-limit
- Learning a classification of mixed-integer quadratic programming problems
- Learning heuristics for the TSP by policy gradient
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Min-up/min-down polytopes
- On learning and branching: a survey
- Random sampling and machine learning to understand good decompositions
- Scikit-learn: machine learning in Python
- The feasibility pump
- Tight MIP formulations of the power-based unit commitment problem
Cited in
(13)- Learning optimal solutions via an LSTM-optimization framework
- One-shot learning for MIPs with SOS1 constraints
- Sensitivity analysis for mixed binary quadratic programming
- Sensitivity analysis for mixed binary quadratic programming
- A novel solution approach with ML-based pseudo-cuts for the flight and maintenance planning problem
- Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
- Enhancing matheuristics for a thermal unit commitment problem through kernel search and local branching
- Learning to repeatedly solve routing problems
- Towards an unsupervised learning scheme for efficiently solving parameterized mixed-integer programs
- A Polyhedral Study on Fuel-Constrained Unit Commitment
- An attention model for the formation of collectives in real-world domains
- Learning to enumerate shifts for large-scale flexible personnel scheduling problems
- Integration of machine constraint learning methods within optimization models
This page was built for publication: Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4995099)
