Static and dynamic routing under disjoint dominant extreme demands
type: Item
instance of: scholarly article
title: Static and dynamic routing under disjoint dominant extreme demands
zbMATH Open document ID: 1207.90020
author: F. Pascali
author: Antonio Frangioni
author: Maria Grazia Scutellà
published in: Operations Research Letters
publication date: 2011-03-22T00:00:00Z
full work available at URL: http://hdl.handle.net/11568/189508
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5869203
zbMATH Keywords: robust optimization
zbMATH Keywords: network design
zbMATH Keywords: Hose model
Wikidata QID: Q118165469
MaRDI profile type: Publication
OpenAlex ID: W2029112512
cites work: Routing of uncertain traffic demands
cites work: Hardness of robust network design
cites work: Designing Least-Cost Nonblocking Broadband Networks
cites work: Q3549729
cites work: Dynamic vs. oblivious routing in network design
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Provisioning a virtual private network
cites work: Integrality Ratio for Group Steiner Trees and Directed Steiner Trees
cites work: Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
cites work: Domination Between Traffic Matrices
cites work: On improving optimal oblivious routing
DOI: 10.1016/J.ORL.2010.11.009
description: scientific article; zbMATH DE number 5869203