@inproceedings{6e2134a4326b49059045d40fb0af99a8,
title = "An Improved Flow Deviation Method for the Maximum Concurrent Flow Problem",
abstract = "The maximum concurrent flow problem (MCFP) is a multicommodity flow problem in which every pair of vertices can send and receive flow concurrently. The objective of MCFP is to find a maximum throughput and the flow corresponding to the throughput under a set of capacity constraints. We present an improved version of the Flow Deviation Method for the maximum concurrent flow problem, which was first presented by Daniel Bienstock and Olga Raskina in 2000. The algorithm is based on linear programming formulation involving Frank-Wolfe procedure and minimum-cost flow problem. The correctness of the algorithm is strictly proved and the performance is evaluated under several networks of different sizes.",
keywords = "flow-deviation algorithm, maximum concurrent flow problem, multicommodity flow",
author = "Yanxiang Chen and Yu Zhang and Mengze Yuan",
note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; 4th IEEE Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2020 ; Conference date: 12-06-2020 Through 14-06-2020",
year = "2020",
month = jun,
doi = "10.1109/ITNEC48623.2020.9085047",
language = "English",
series = "Proceedings of 2020 IEEE 4th Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2020",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1179--1182",
editor = "Bing Xu and Kefen Mou",
booktitle = "Proceedings of 2020 IEEE 4th Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2020",
address = "United States",
}
