On Three Approaches To Length-Bounded Maximum Multicommodity Flow With Unit Edge-Lengths
Yugoslav journal of operations research, Tome 29 (2019) no. 1, p. 93
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
The paper presents a comparison between three approaches to solving the
length-bounded maximum multicommodity flow problem with unit edge-lengths. Following the first approach, Garg and Könemann’s, we developed an improved fully polynomial-time approximation scheme for this problem. As the second alternative, we considered the
well-known greedy approach. The third approach is the one that yields exact solutions by
means of a standard LP solver applied to an LP model on the time-expanded network.
Computational experiments are carried out on benchmark graphs and the graphs that
model software defined satellite networks, to compare the proposed algorithms with an
exact linear programming solver. The results of the experiments demonstrate a trade-off
between the computing time and the precision of algorithms under consideration.
Classification :
65K05, 68M10
Keywords: Computational Experiment, Linear Programming, Fully Polynomial-Time Approximation Scheme, Greedy Heuristic, Software Defined Satellite Network
Keywords: Computational Experiment, Linear Programming, Fully Polynomial-Time Approximation Scheme, Greedy Heuristic, Software Defined Satellite Network
@article{YJOR_2019_29_1_a6,
author = {Pavel Borisovsky and Anton Eremeev and Sergei Hrushev and Vadim Teplyakov and Mikhail Vorozhtsov},
title = {On {Three} {Approaches} {To} {Length-Bounded} {Maximum} {Multicommodity} {Flow} {With} {Unit} {Edge-Lengths}},
journal = {Yugoslav journal of operations research},
pages = {93 },
year = {2019},
volume = {29},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2019_29_1_a6/}
}
TY - JOUR AU - Pavel Borisovsky AU - Anton Eremeev AU - Sergei Hrushev AU - Vadim Teplyakov AU - Mikhail Vorozhtsov TI - On Three Approaches To Length-Bounded Maximum Multicommodity Flow With Unit Edge-Lengths JO - Yugoslav journal of operations research PY - 2019 SP - 93 VL - 29 IS - 1 UR - http://geodesic.mathdoc.fr/item/YJOR_2019_29_1_a6/ LA - en ID - YJOR_2019_29_1_a6 ER -
%0 Journal Article %A Pavel Borisovsky %A Anton Eremeev %A Sergei Hrushev %A Vadim Teplyakov %A Mikhail Vorozhtsov %T On Three Approaches To Length-Bounded Maximum Multicommodity Flow With Unit Edge-Lengths %J Yugoslav journal of operations research %D 2019 %P 93 %V 29 %N 1 %U http://geodesic.mathdoc.fr/item/YJOR_2019_29_1_a6/ %G en %F YJOR_2019_29_1_a6
Pavel Borisovsky; Anton Eremeev; Sergei Hrushev; Vadim Teplyakov; Mikhail Vorozhtsov. On Three Approaches To Length-Bounded Maximum Multicommodity Flow With Unit Edge-Lengths. Yugoslav journal of operations research, Tome 29 (2019) no. 1, p. 93 . http://geodesic.mathdoc.fr/item/YJOR_2019_29_1_a6/