Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
From MaRDI portal
Publication:1945698
DOI10.1007/s10878-011-9422-2zbMath1269.90132MaRDI QIDQ1945698
Alexey Sorokin, Artyom Nahapetyan, Panos M. Pardalos, Vladimir L. Boginski
Publication date: 8 April 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9422-2
uncertainty; heuristics; conditional value-at-risk; arc failures; fixed charge network flow problem; quantitative risk measures
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
Related Items
A two-stage resource allocation model for lifeline systems quick response with vulnerability analysis, Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption, On risk-averse maximum weighted subgraph problems, Branch-and-cut approaches for chance-constrained formulations of reliable network design problems, On the chance-constrained minimum spanning \(k\)-core problem
Cites Work
- Unnamed Item
- Unnamed Item
- Polynomial-time identification of robust network flows under uncertain arc failures
- Solving to optimality the uncapacitated fixed-charge network flow problem
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A survey on Benders decomposition applied to fixed-charge network design problems
- The wireless network jamming problem
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- Supply chain optimization.
- Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
- The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment
- Some branch-and-bound procedures for fixed-cost transportation problems
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- Network optimization in supply chain management and financial engineering: An annotated bibliography
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- An approximate solution method for the fixed charge problem
- The fixed charge problem
- An approximative algorithm for the fixed charge problem
- The fixed charge problem
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
