On the robustness of potential-based flow networks

DOI10.1007/s10107-021-01760-wOpenAlexW4210863053MaRDI QIDQ2689822

Max Klimm, Marc E. Pfetsch, Martin Skutella, Rico Raber

Publication date: 14 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-021-01760-w

zbMATH Keywords

robustnessnode-labeled graph minorspotential-based network flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Graph minors (05C83) Random walks on graphs (05C81) Flows in graphs (05C21)

Uses Software

• GasLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single-commodity robust network design with finite and hose demand sets
• Single-commodity robust network design problem: complexity, instances and heuristic solutions
• Robust solutions of uncertain linear programs
• Graph minors. XIII: The disjoint paths problem
• A multilevel model of the European entry-exit gas market
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• Evaluating Gas Network Capacities
• An Exact Algorithm for Robust Network Design
• The Gas Transmission Problem Solved by an Extension of the Simplex Algorithm
• Non-linear network problems
• Synthesis of a Communication Net
• An Application of Generalized Linear Programming to Network Flows
• Multi-Terminal Network Flows
• Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
• Integer Solution to Synthesis of Communication Networks
• Solving the Pipe Network Analysis Problem Using Optimization Techniques
• Designing Least-Cost Nonblocking Broadband Networks
• Simple Constructions for Multiterminal Network Flow Synthesis
• Network synthesis with few edges
• Provisioning a virtual private network
• Integer Exact Network Synthesis Problem
• Algorithmic results for potential‐based flows: Easy and hard cases
• The VPN Conjecture Is True
• Synthesis of a Communication Network
• Capacitated Network Design—Polyhedral Structure and Computation

This page was built for publication: On the robustness of potential-based flow networks