Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems (Q4995099): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.2020.0976 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Scikit / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JuMP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3092319930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5169898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine Learning-Based Approximation of Strong Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling and machine learning to understand good decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine learning for combinatorial optimization: a methodological tour d'horizon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Julia: A Fresh Approach to Numerical Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a classification of mixed-integer quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of production ramping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning heuristics for the TSP by policy gradient / rank
 
Normal rank
Property / cites work
 
Property / cites work: JuMP: A Modeling Language for Mathematical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning MILP resolution outcomes before reaching time-limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-up/min-down polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On learning and branching: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical decision model learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight MIP formulations of the power-based unit commitment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396710 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/IJOC.2020.0976 / rank
 
Normal rank

Latest revision as of 15:33, 30 December 2024

scientific article; zbMATH DE number 7362344
Language Label Description Also known as
English
Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
scientific article; zbMATH DE number 7362344

    Statements

    Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems (English)
    0 references
    0 references
    0 references
    0 references
    23 June 2021
    0 references
    security-constrained unit commitment
    0 references
    mixed integer linear programming
    0 references
    machine learning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers