Robust transshipment problem under consistent flow constraints

DOI10.1002/net.22184zbMath1530.90014arXiv2208.13487MaRDI QIDQ6180042

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

Publication date: 18 January 2024

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

minimum cost flowdemand uncertaintytransshipment problemseries-parallel digraphsequal flow problemrobust flows

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (1)

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
• 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 Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
• Integer Programming with a Fixed Number of Variables
• Provisioning virtual private networks under traffic uncertainty
• The Price of Robustness
• The Recognition of Series Parallel Digraphs
• Computationally Related Problems
• Network Flow Optimization with Minimum Quantities
• Robust network design: Formulations, valid inequalities, and computations
• Combinatorial optimization. Theory and algorithms.
• Integrality in the multinetwork min‐cost equal‐flow problem

This page was built for publication: Robust transshipment problem under consistent flow constraints