Maximum concurrent flow with incomplete data
type: Item
instance of: scholarly article
title: Maximum concurrent flow with incomplete data
zbMATH Open document ID: 1403.90629
DOI: 10.1007/978-3-319-96151-4_7
author: Pierre-Olivier Bauguion
author: Claudia D'Ambrosio
author: Leo Liberti
publication date: 2018-08-17T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 6919939
zbMATH Keywords: maximum concurrent flow
zbMATH Keywords: multi-commodity flow problems
zbMATH Keywords: incomplete data
zbMATH Keywords: unknown data
zbMATH Keywords: uncertainty
zbMATH Keywords: inverse optimization
zbMATH Keywords: transportation systems
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-319-96151-4 7
OpenAlex ID: W2884383321
Recommended article: Q3501698
Recommended article: The maximum concurrent flow problem
Recommended article: Maximum concurrent flows and minimum cuts
Recommended article: Approximation Algorithms for the Maximum Concurrent Flow Problem
Recommended article: Efficient algorithms for the maximum concurrent flow problem
Recommended article: Maximum flow under proportional delay constraint
Recommended article: Q4635958
Recommended article: Q4873777
Recommended article: Maximum flows in generalized processing networks
description: scientific article; zbMATH DE number 6919939