Metrika članka

  • citati u SCindeksu: 0
  • citati u CrossRef-u:0
  • citati u Google Scholaru:[=>]
  • posete u poslednjih 30 dana:0
  • preuzimanja u poslednjih 30 dana:0
članak: 7 od 9  
Back povratak na rezultate
Yugoslav Journal of Operations Research
2019, vol. 29, br. 1, str. 93-112
jezik rada: engleski
vrsta rada: neklasifikovan
objavljeno: 28/02/2019
doi: 10.2298/YJOR181015034B
On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
(naslov ne postoji na srpskom)
aSobolev Institute of Mathematics SB RAS, Omsk, Russia
bSobolev Institute of Mathematics SB RAS, Omsk, Russia + Dostoevsky Omsk State University, Omsk, Russia
cYaliny Research and Development Center, Moscow, Russia

e-adresa: borisovski@mail.ru, eremeev@ofim.oscsbras.ru, hrus

Projekat

This research is supported by the Russian Science Foundation grant 15-11-10009.

Sažetak

(ne postoji na srpskom)
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 Konemann'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.

Ključne reči

Computational Experiment; Linear Programming; Fully Polynomial-Time Approximation Scheme; Greedy Heuristic; Software Defined Satellite Network