A bicriteria almost equal minimum cost flow model for day-ahead trading

DOI10.1007/978-3-031-24907-5_22zbMATH Open1547.90047MaRDI QIDQ6606541FDOQ6606541

Authors Elisabeth Finhold, T. Heller, Sven O. Krumke, Neele Leithäuser 

Publication date 17 September 2024

zbMATH Keywords

network flowsminimum cost flowparametric searchenergy trading

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Financial markets (91G15)

Recommendations

• Strategic bidding in price coupled regions
• An optimal trading problem in intraday electricity markets
• Optimal bidding functions for renewable energies in sequential electricity markets
• Revisiting minimum profit conditions in uniform price day-ahead electricity auctions
• Integrated day-ahead and intraday self-schedule bidding for energy storage systems using approximate dynamic programming

Cites work

• A characterization of the minimum cycle mean in a digraph
• Algorithms and complexity for the almost equal maximum flow problem
• Combinatorial optimization with rational objective functions
• Finding minimum-cost circulations by canceling negative cycles
• Maximizing non-linear concave functions in fixed dimension

This page was built for publication: A bicriteria almost equal minimum cost flow model for day-ahead trading

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606541)