Maximum Concurrent Flow with Incomplete Data - Archive ouverte HAL Access content directly
Book Sections Year : 2018

Maximum Concurrent Flow with Incomplete Data


The Maximum Concurrent Flow Problem (MCFP) is often used in the planning of transportation and communication networks. We discuss here the MCFP with incomplete data. We call this new problem the Incomplete Maximum Concurrent Flow Problem (IMCFP). The main objective of IMCFP is to complete the missing information assuming the known and unknown data form a MCFP and one of its optimal solutions. We propose a new solution technique to solve the IMCFP which is based on a linear programming formulation involving both pri-mal and dual variables, which optimally decides values for the missing data so that they are compatible with a set of scenarios of different incomplete data sets. We prove the correctness of our formulation and benchmark it on many different instances.
Fichier principal
Vignette du fichier
isco18b.pdf (150.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02105082 , version 1 (20-04-2019)



Pierre-Olivier Bauguion, Claudia D’ambrosio, Leo Liberti. Maximum Concurrent Flow with Incomplete Data. Combinatorial Optimization 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers, pp.77-88, 2018, 978-3-319-96150-7. ⟨10.1007/978-3-319-96151-4_7⟩. ⟨hal-02105082⟩
67 View
86 Download



Gmail Facebook Twitter LinkedIn More