Robust minimum cost flow problem under consistent flow constraints

DOI10.1007/s10479-021-04426-0zbMath1494.90120arXiv2008.02035OpenAlexW3047602970MaRDI QIDQ2673801

Sabrina Schmitz, Arie M. C. A. Koster, Christina Büsing

Publication date: 13 June 2022

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

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

zbMATH Keywords

dynamic programmingminimum cost flow problemseries-parallel digraphsequal flow problemrobust flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Robustness in mathematical programming (90C17)

Related Items

Integrality in the multinetwork min‐cost equal‐flow problem, Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single-commodity robust network design with finite and hose demand sets
• The maximum flow problem with disjunctive constraints
• Network models for vehicle and crew scheduling
• Integer equal flows
• Minimum cost flow algorithms for series-parallel networks
• The equal flow problem
• Network simplex algorithm for the general equal flow problem.
• Robust discrete optimization and network flows
• Minimum cost flows with minimum quantities
• The robust network loading problem with dynamic routing
• Multi-layer MPLS network design: The impact of statistical multiplexing
• The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
• Integer Programming with a Fixed Number of Variables
• Algorithms for the Simple Equal Flow Problem
• Models and Algorithms for Robust Network Design with Several Traffic Scenarios
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• Provisioning virtual private networks under traffic uncertainty
• The Price of Robustness
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• The Recognition of Series Parallel Digraphs
• Computationally Related Problems
• Network Flow Optimization with Minimum Quantities
• Robust network design: Formulations, valid inequalities, and computations
• Affine recourse for the robust network design problem: Between static and dynamic routing
• Combinatorial optimization. Theory and algorithms.