Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
DOI10.1080/10556788.2017.1401069zbMath1407.90077OpenAlexW2770631757MaRDI QIDQ4622891
Veronika Grimm, Frauke Liers, Gregor Zöttl, Martin Schmidt, Thomas Kleinert
Publication date: 18 February 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2017.1401069
graph partitioningmultilevel optimizationmixed-integer nonlinear optimizationelectricity market designgeneralized benders decomposition
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transmission and generation investment in electricity markets: the effects of market splitting and network fee regimes
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- SCIP: solving constraint integer programs
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- The EU regulation on cross-border trade of electricity: a two-stage equilibrium model
- Packing and partitioning orbitopes
- Partitioning procedures for solving mixed-variables programming problems
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Descent approaches for quadratic bilevel programming
- Pruning by isomorphism in branch-and-cut
- Graph partitioning using linear and semidefinite programming
- Exploiting orbits in symmetric ILP
- A computational comparison of symmetry handling methods for mixed integer programs
- Uniqueness of market equilibrium on a network: a peak-load pricing approach
- Facets of the \(k\)-partition polytope
- The partition problem
- A branch-and-cut algorithm for graph coloring
- Generalized Benders decomposition
- Improving Discrete Model Representations via Symmetry Considerations
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Solving Connected Subgraph Problems in Wildlife Conservation
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- Randomized heuristics for the Max-Cut problem
- On the cut polytope
- Optimality conditions for bilevel programming problems
- Graph Partitioning and Graph Clustering
- Imposing Connectivity Constraints in Forest Planning Models
- Bilevel Programming Problems
- Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
- Orbitopal Fixing
- Orbital Branching
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Geometry of cuts and metrics
- Benchmarking optimization software with performance profiles.
This page was built for publication: Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches