Communication-Constrained Expansion Planning for Resilient Distribution Systems
From MaRDI portal
Publication:5148181
DOI10.1287/ijoc.2019.0899zbMath1456.90038arXiv1801.03520OpenAlexW3017364216MaRDI QIDQ5148181
Harsha Nagarajan, Geunyeong Byeon, Pascal Van Hentenryck, Russell Bent
Publication date: 1 February 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.03520
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)
Related Items (max. 100)
Optimal Power Flow in Distribution Networks Under N – 1 Disruptions: A Multistage Stochastic Programming Approach ⋮ Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
Cites Work
- Unnamed Item
- On the choice of explicit stabilizing terms in column generation
- Stabilized column generation
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
- A scenario decomposition algorithm for 0-1 stochastic programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Selected Topics in Column Generation
This page was built for publication: Communication-Constrained Expansion Planning for Resilient Distribution Systems