Maximum Throughput Network Routing Subject to Fair Flow Allocation
Maximum Throughput Network Routing Subject to Fair Flow Allocation
1-12
Amaldi, Edoardo
eefad18b-86c1-4a8f-a931-23e8ddd59d6e
Coniglio, Stefano
03838248-2ce4-4dbc-a6f4-e010d6fdac67
Taccari, Leonardo
53ecb5ea-8f74-417e-aef9-ff31dbb33b2f
2014
Amaldi, Edoardo
eefad18b-86c1-4a8f-a931-23e8ddd59d6e
Coniglio, Stefano
03838248-2ce4-4dbc-a6f4-e010d6fdac67
Taccari, Leonardo
53ecb5ea-8f74-417e-aef9-ff31dbb33b2f
Amaldi, Edoardo, Coniglio, Stefano and Taccari, Leonardo
(2014)
Maximum Throughput Network Routing Subject to Fair Flow Allocation.
In Combinatorial Optimization, LNCS (Proc. of 3rd International Symposium on Combinatorial Optimization, ISCO).
.
Record type:
Conference or Workshop Item
(Paper)
This record has no associated files available for download.
More information
Published date: 2014
Organisations:
Operational Research
Identifiers
Local EPrints ID: 410175
URI: http://eprints.soton.ac.uk/id/eprint/410175
PURE UUID: 16215e43-edb5-4551-9694-5f5181c5f47f
Catalogue record
Date deposited: 06 Jun 2017 04:02
Last modified: 08 Jan 2022 03:26
Export record
Contributors
Author:
Edoardo Amaldi
Author:
Leonardo Taccari
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics