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...

Full description

Saved in:

Bibliographic Details
Published in:	OR Spectrum Vol. 41; no. 2; pp. 469 - 489
Main Authors:	Halman, Nir, Kovalyov, Mikhail Y., Quilliot, Alain, Shabtay, Dvir, Zofi, Moshe
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2019 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!