Single-commodity network design with random edge capacities
type: Item
instance of: scholarly article
title: Single-commodity network design with random edge capacities
zbMATH Open document ID: 1253.90063
author: Biju K. Thapalia
author: Teodor Gabriel Crainic
author: Michal Kaut
author: Stein W. Wallace
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90B15
zbMATH DE Number: 6119370
zbMATH Keywords: network flows
zbMATH Keywords: single-commodity network design
zbMATH Keywords: survivable networks
zbMATH Keywords: edge failure
zbMATH Keywords: correlations
zbMATH Keywords: robustness
describes a project that uses: CPLEX
describes a project that uses: SNDlib
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.01.026
OpenAlex ID: W2091793658
cites work: Designing hierarchical survivable networks
cites work: Q4845373
cites work: An Oil Pipeline Design Problem
cites work: An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
cites work: Optimal Dimensioning of Pipe Networks with Application to Gas Transmission Networks
cites work: An open graph visualization system and its applications to software engineering
cites work: A heuristic for moment-matching scenario generation
cites work: Q5444109
cites work: Mixed integer models for the stationary case of gas network optimization
cites work: Particle swarm optimization applied to the design of water supply systems
cites work: A quick method for finding shortest pairs of disjoint paths
cites work: Single source single-commodity stochastic network design
cites work: A piecewise linear upper bound on the network recourse function
DOI: 10.1016/J.EJOR.2012.01.026
description: scientific article; zbMATH DE number 6119370