A fully polynomial time approximation scheme for the probability maximizing shortest path problem
Year of publication: |
2022
|
---|---|
Authors: | Lee, Jisun ; Joung, Seulgi ; Lee, Kyungsik |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 300.2022, 1 (1.7.), p. 35-45
|
Subject: | Combinatorial optimization | Exact algorithm | Fully polynomial time approximation scheme | Probability maximization | Shortest path | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Wahrscheinlichkeitsrechnung | Probability theory |
-
A new branch-and-filter exact algorithm for binary constraint satisfaction problems
San Segundo, Pablo, (2022)
-
CliSAT : a new exact algorithm for hard maximum clique problems
San Segundo, Pablo, (2023)
-
Vector scheduling with rejection on a single machine
Li, Weidong, (2018)
- More ...
-
Kwon, Sue-Jeong, (2019)
-
A linear programming based heuristic algorithm for bandwidth packing problem with scheduling
Joung, Seulgi, (2020)
-
Lifting of probabilistic cover inequalities
Joung, Seulgi, (2017)
- More ...