Global optimization of multilevel electricity market models including network design and graph partitioning
type: Item
instance of: scholarly article
title: Global optimization of multilevel electricity market models including network design and graph partitioning
zbMATH Open document ID: 1474.90302
author: Thomas Kleinert
author: Martin Schmidt
published in: Discrete Optimization
publication date: 2019-11-28T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7138061
zbMATH Keywords: network design
zbMATH Keywords: graph partitioning
zbMATH Keywords: multilevel optimization
zbMATH Keywords: mixed integer optimization
zbMATH Keywords: electricity market design
describes a project that uses: SQPlab
describes a project that uses: Gurobi
describes a project that uses: PLCP
MaRDI profile type: Publication
full work available at URL: j.disopt.2019.02.002
OpenAlex ID: W2785764032
cites work: Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
cites work: Transmission and generation investment in electricity markets: the effects of market splitting and network fee regimes
cites work: Investment in electricity networks with transmission switching
cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications
cites work: Approximating the \(k\)-splittable capacitated network design problem
cites work: Network design with weighted degree constraints
cites work: Using mixed-integer programming to solve power grid blackout problems
cites work: Robust Optimization for Power Systems Capacity Expansion under Uncertainty
cites work: Q4845372
cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem
cites work: Geometry of cuts and metrics
cites work: On the cut polytope
cites work: The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
cites work: Facets of the \(k\)-partition polytope
cites work: The partition problem
cites work: Generating partitions of a graph into a fixed number of minimum weight cuts
cites work: Projection results for the \(k\)-partition problem
cites work: Imposing Connectivity Constraints in Forest Planning Models
cites work: Solving Connected Subgraph Problems in Wildlife Conservation
cites work: Q4248932
cites work: New Branch-and-Bound Rules for Linear Bilevel Programming
cites work: Bilevel Programming Problems
cites work: Bilevel programming and the separation problem
cites work: Generation Capacity Expansion in Imperfectly Competitive Restructured Electricity Markets
cites work: Q4817267
cites work: Uniqueness of market equilibrium on a network: a peak-load pricing approach
cites work: The EU regulation on cross-border trade of electricity: a two-stage equilibrium model
cites work: Uniqueness and multiplicity of market equilibria on DC power flow networks
cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Generalized Benders decomposition
cites work: Numerical optimization. Theoretical and practical aspects. Transl. from the French
cites work: The Mixed Integer Linear Bilevel Programming Problem
cites work: Benchmarking optimization software with performance profiles.
Wikidata QID: Q128042856
DOI: 10.1016/J.DISOPT.2019.02.002
description: scientific article; zbMATH DE number 7138061