Bi-criteria path problem with minimum length and maximum survival probability

We study a bi-criteria path problem on a directed multigraph with cycles, where each arc is associated with two parameters. The first is the survival probability of moving along the arc, and the second is the length of the arc. We evaluate the quality of a path by two independent criteria. The first...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	OR Spectrum Ročník 41; číslo 2; s. 469 - 489
Hlavní autori:	Halman, Nir, Kovalyov, Mikhail Y., Quilliot, Alain, Shabtay, Dvir, Zofi, Moshe
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2019 Springer Nature B.V
Predmet:	Algorithms Approximation Business and Management Calculus of Variations and Optimal Control; Optimization Criteria Logarithms Mathematical analysis Operations Research/Decision Theory Polynomials Probability Regular Article Rounding Survival Shortest path problem Bi-criteria optimization Approximation algorithms Survival probability
ISSN:	0171-6468, 1436-6304
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!