Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently (Q2116884): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the determination of European day ahead electricity prices: the Turkish case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Review of Pricing Schemes in Markets with Non-Convex Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A MIP framework for non-convex uniform price day-ahead electricity auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting minimum profit conditions in uniform price day-ahead electricity auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict linear prices in non-convex European day-ahead electricity markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient market-clearing prices in markets with nonconvexities / rank
 
Normal rank

Revision as of 08:59, 28 July 2024

scientific article
Language Label Description Also known as
English
Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently
scientific article

    Statements

    Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently (English)
    0 references
    0 references
    0 references
    0 references
    18 March 2022
    0 references
    OR in energy
    0 references
    day-ahead electricity market clearing problem
    0 references
    mixed-integer linear programming
    0 references
    Benders decomposition
    0 references
    0 references
    0 references

    Identifiers