Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
type: Item
instance of: scholarly article
title: Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
zbMATH Open document ID: 1269.90132
author: Alexey Sorokin
author: Artyom Nahapetyan
author: Panos M. Pardalos
author: Vladimir Boginski
published in: Journal of Combinatorial Optimization
publication date: 2013-04-08T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6151675
zbMATH Keywords: fixed charge network flow problem
zbMATH Keywords: heuristics
zbMATH Keywords: uncertainty
zbMATH Keywords: arc failures
zbMATH Keywords: quantitative risk measures
zbMATH Keywords: conditional value-at-risk
MaRDI profile type: Publication
full work available at URL: s10878-011-9422-2
OpenAlex ID: W1964511029
cites work: Two-Stage Robust Network Flow and Design Under Demand Uncertainty
cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
cites work: A New Optimization Method for Large Scale Fixed Charge Transportation Problems
cites work: Polynomial-time identification of robust network flows under uncertain arc failures
cites work: Some branch-and-bound procedures for fixed-cost transportation problems
cites work: The wireless network jamming problem
cites work: An approximate solution method for the fixed charge problem
cites work: A survey on Benders decomposition applied to fixed-charge network design problems
cites work: Solving to optimality the uncapacitated fixed-charge network flow problem
cites work: An approximative algorithm for the fixed charge problem
cites work: Network optimization in supply chain management and financial engineering: An annotated bibliography
cites work: Supply chain optimization.
cites work: Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
cites work: Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
cites work: The fixed charge problem
cites work: A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
cites work: The uncapacitated time-space fixed-charge network flow problem: an empirical investigation of procedures for arc capacity assignment
cites work: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points
cites work: A bilinear relaxation based algorithm for concave piecewise linear network flow problems
cites work: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
cites work: Q4943600
cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
cites work: Q4495146
DOI: 10.1007/S10878-011-9422-2
Recommended article: Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
Recommended article: A risk management model for improving operation and maintenance activities in electricity transmission networks
Recommended article: Polynomial-time identification of robust network flows under uncertain arc failures
Recommended article: Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
Recommended article: Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption
Recommended article: A combinatorial arc tolerance analysis for network flow problems
Recommended article: Numeric simulation of faults in electrical networks
Recommended article: Network Risk Limiting Dispatch: Optimal Control and Price of Uncertainty
Recommended article: A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
description: scientific article; zbMATH DE number 6151675