Solving the unit commitment problem by a unit decommitment method (Q1586810): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal scheduling of thermal generating units / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal short-term scheduling of large-scale power systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank

Latest revision as of 08:59, 3 June 2024

scientific article
Language Label Description Also known as
English
Solving the unit commitment problem by a unit decommitment method
scientific article

    Statements

    Solving the unit commitment problem by a unit decommitment method (English)
    0 references
    0 references
    20 November 2000
    0 references
    power system scheduling
    0 references
    unit commitment
    0 references
    unit decommitment
    0 references
    mixed-integer programming
    0 references
    Lagrangian relaxation
    0 references
    heuristic procedures
    0 references

    Identifiers