A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching

DOI10.1287/opre.2015.1471zbMath1348.90599arXiv1412.6245OpenAlexW2170578370MaRDI QIDQ2830766

Burak Kocuk, X. Andy Sun, Hyemin Jeon, Jeff Linderoth, James R. Luedtke, Santanu S. Dey

Publication date: 31 October 2016

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.6245

zbMATH Keywords

integer programmingelectric industriescutting plane/facets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Integer programming (90C10)

Related Items (12)

Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ The complexity of flow expansion and electrical flow expansion ⋮ Derivation and generation of path-based valid inequalities for transmission expansion planning ⋮ A data mining transmission switching heuristic for post-contingency AC power flow violation reduction in real-world, large-scale systems ⋮ A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation ⋮ A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid ⋮ Strong SOCP Relaxations for the Optimal Power Flow Problem ⋮ Node-based valid inequalities for the optimal transmission switching problem ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Network-Based Approximate Linear Programming for Discrete Optimization ⋮ Electrical flows over spanning trees ⋮ Operations research in optimal power flow: a guide to recent and emerging methodologies and applications

Uses Software

• CPLEX

Cites Work

• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• Investment in electricity networks with transmission switching
• Using mixed-integer programming to solve power grid blackout problems
• Faster Algorithms for Minimum Cycle Basis in Directed Graphs
• On the cut polytope
• On the facial structure of set packing polyhedra
• The Continuous Mixing Polyhedron
• Benchmarking optimization software with performance profiles.

This page was built for publication: A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching