Pregled bibliografske jedinice broj: 1095014
Solving robust variants of integer flow problems with uncertain arc capacities
Solving robust variants of integer flow problems with uncertain arc capacities // Promet - Traffic & transportation, 33 (2021), 1; 77-89 doi:10.7307/ptt.v33i1.3538 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1095014 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Solving robust variants of integer flow problems
with uncertain arc capacities
Autori
Špoljarec, Marko ; Manger, Robert
Izvornik
Promet - Traffic & transportation (0353-5320) 33
(2021), 1;
77-89
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Network flow ; Integer flow ; Robust optimization ; Algorithm
Sažetak
This paper is concerned with robust optimization and with network flows. Several robust variants of integer flow problems are considered. They assume uncertainty of network arc capacities as well as of arc unit costs (where applicable). Uncertainty is expressed by discrete scenarios. Since the considered variants of the maximum flow problem are easy to solve, the paper is mostly concerned with NP-hard variants of the minimum-cost flow problem, thus proposing an approximate algorithm for their solution. Accuracy of the proposed algorithm is verified by experiments.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Računarstvo
POVEZANOST RADA
Projekti:
HRZZ-IP-2018-01-5591 - Efikasni algoritmi za robusnu diskretnu optimizaciju (RoDiOpt) (Manger, Robert, HRZZ ) ( CroRIS)
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb,
Prirodoslovno-matematički fakultet, Zagreb
Profili:
Robert Manger
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
