Pregled bibliografske jedinice broj: 1094994
Heuristic solutions to robust variants of the minimum-cost integer flow problem
Heuristic solutions to robust variants of the minimum-cost integer flow problem // Journal of heuristics, 26 (2020), 531-559 doi:10.1007/s10732-020-09441-1 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1094994 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Heuristic solutions to robust variants of the
minimum-cost integer flow problem
Autori
Špoljarec, Marko ; Manger, Robert
Izvornik
Journal of heuristics (1381-1231) 26
(2020);
531-559
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Robust optimization ; Network flow ; Minimum-cost flow ; Heuristic ; Local search ; Evolutionary computing
Sažetak
This paper deals with robust optimization applied to network flows. We consider two robust variants of the minimum-cost integer flow problem. Thereby, uncertainty in problem formulation is limited to arc costs and expressed by a finite set of explicitly given scenarios. It turns out that both problem variants are NP-hard. To solve the considered variants, we propose several heuristics based on local search or evolutionary computing. We also evaluate our heuristics experimentally on appropriate problem instances.
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:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
