A MIP framework for non-convex uniform price day-ahead electricity auctions

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:EURO journal on computational optimization
1. Verfasser: Madani, Mehdi (VerfasserIn)
Weitere Verfasser: Van Vyve, Mathieu (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: March 2017
Schlagworte:
Day-ahead electricity market auctions > Non-convexities > Mixed integer programming > Market coupling > Equilibrium prices > Aufsatz in Zeitschrift
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Special issue on: computational discrete optimization 2020 Koster, Arie M.C.A.
An exploratory computational analysis of dual degeneracy in mixed-integer programming 2020 Gamrath, Gerald
A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber 2020 Ackermann, Heiner
The complete vertex p-center problem 2020 Medrano, F. Antonio
Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games 2020 Basilico, Nicola
Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent 2020 Jiang, Wei
On conditional cuts for stochastic dual dynamic programming 2020 Ackooij, Wim van
Computing Euclidean Steiner trees over segments 2020 Althaus, Ernst
[Epsilon]-constraint method for bi-objective competitive facility location problem with uncertain demand scenario 2020 Beresnev, Vladimir
Joint location and pricing within a user-optimized environment 2020 Dan, Teodora
A robust p-Center problem under pressure to locate shelters in wildfire context 2020 Demange, Marc
A distributionally robust optimization approach for two-stage facility location problems 2020 Gourtani, Arash
Special issue on bilevel optimization 2020 Brotcorne, Luce
Two-row and two-column mixed-integer presolve using hashing-based pairing methods 2020 Gemander, Patrick
An exact approach for the multi-constraint graph partitioning problem 2020 Recalde, Diego
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers 2019 Attia, Dalia
A polyhedral approach to the generalized minimum labeling spanning tree problem 2019 Silva, Thiago Gouveia da
An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in Rn 2019 Santiago, Cláudio P.
Formulations and algorithms for the recoverable -robust knapsack problem 2019 Büsing, Christina
Real-time algorithms for the bilevel double-deck elevator dispatching problem 2019 Sorsa, Janne
Alle Artikel auflisten