A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source maximum concurrent flow

International audience

Data and Resources

Additional Info

Field Value
Source INOC '13 : International Network Optimization Conference
Author Bauguion, Pierre-Olivier, Ben-Ameur, Walid, Gourdin, Eric
Maintainer CCSD
Last Updated May 10, 2026, 13:47 (UTC)
Created May 10, 2026, 13:47 (UTC)
Identifier hal-00838566
Language en
contributor Département Réseaux et Services Multimédia Mobiles (TSP - RS2M) ; Télécom SudParis (TSP) ; Institut Mines-Télécom [Paris] (IMT)-Institut Polytechnique de Paris (IP Paris)-Institut Mines-Télécom [Paris] (IMT)-Institut Polytechnique de Paris (IP Paris)
coverage Tenerife, Spain
creator Bauguion, Pierre-Olivier
date 2013-05-20T00:00:00
harvest_object_id c0ed5827-9d00-4911-b213-8da612675f1f
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2026-01-21T00:00:00
relation info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2013.05.107
set_spec type:COMM