An optimal capacity assignment for the robust design problem in capacitated flow networks
type: Item
instance of: scholarly article
title: An optimal capacity assignment for the robust design problem in capacitated flow networks
zbMATH Open document ID: 1254.90031
author: Shin-Guang Chen
published in: Applied Mathematical Modelling
publication date: 2013-01-13T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6124851
zbMATH Keywords: capacitated-flow network
zbMATH Keywords: capacity assignment
zbMATH Keywords: robustness
zbMATH Keywords: critical analysis
zbMATH Keywords: structural analysis
zbMATH Keywords: network reliability
MaRDI profile type: Publication
full work available at URL: j.apm.2011.12.034
OpenAlex ID: W2070136552
cites work: Q4324749
cites work: Assignment problems: a golden anniversary survey
cites work: Integrated supply chain planning under uncertainty using an improved stochastic approach
cites work: Reliable and economic resource allocation in an unreliable flow network
cites work: Optimal resource assignment to maximize multistate network reliability for a computer network
cites work: Reliability Evaluation of Multistate Systems with Multistate Components
cites work: A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
cites work: Q5514188
cites work: Multistate components assignment problem with optimal network reliability subject to assignment budget
DOI: 10.1016/J.APM.2011.12.034
description: scientific article; zbMATH DE number 6124851