 |
Book sections
Maximum Concurrent Flow with Incomplete Data
Abstract : 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.
Cited literature [23 references]
https://hal.archives-ouvertes.fr/hal-02105082
Contributor : Leo Liberti <>
Submitted on : Saturday, April 20, 2019 - 12:44:55 AM
Last modification on : Tuesday, July 21, 2020 - 10:48:02 AM
Contributor : Leo Liberti <>
Submitted on : Saturday, April 20, 2019 - 12:44:55 AM
Last modification on : Tuesday, July 21, 2020 - 10:48:02 AM
File
isco18b.pdf
Files produced by the author(s)
