On single-path network routing subject to max-min fair flow allocation
On single-path network routing subject to max-min fair flow allocation
543-550
Amaldi, Edoardo
eefad18b-86c1-4a8f-a931-23e8ddd59d6e
Coniglio, Stefano
03838248-2ce4-4dbc-a6f4-e010d6fdac67
Gianoli, Luca G
0b585958-bc19-4f04-bf84-a69d17b1cb0e
Ileri, Can Umut
db42bc59-7c30-43a0-ad21-3731d40cc4da
2013
Amaldi, Edoardo
eefad18b-86c1-4a8f-a931-23e8ddd59d6e
Coniglio, Stefano
03838248-2ce4-4dbc-a6f4-e010d6fdac67
Gianoli, Luca G
0b585958-bc19-4f04-bf84-a69d17b1cb0e
Ileri, Can Umut
db42bc59-7c30-43a0-ad21-3731d40cc4da
Amaldi, Edoardo, Coniglio, Stefano, Gianoli, Luca G and Ileri, Can Umut
(2013)
On single-path network routing subject to max-min fair flow allocation.
In Electronic Notes in Discrete Mathematics (6th International Network Optimization Conference, INOC 2013).
vol. 41,
.
Record type:
Conference or Workshop Item
(Paper)
This record has no associated files available for download.
More information
Published date: 2013
Organisations:
Operational Research
Identifiers
Local EPrints ID: 410172
URI: http://eprints.soton.ac.uk/id/eprint/410172
PURE UUID: 992c0a82-234b-4e99-8165-ed53442c39c2
Catalogue record
Date deposited: 06 Jun 2017 04:02
Last modified: 09 Jan 2022 03:51
Export record
Contributors
Author:
Edoardo Amaldi
Author:
Luca G Gianoli
Author:
Can Umut Ileri
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