On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
Year of publication: |
2010
|
---|---|
Authors: | Pinto, Leizer Limo ; Pascoal, Marta M. B. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 37.2010, 10, p. 1774-1779
|
Subject: | Algorithmus | Algorithm | Engpass | Bottleneck | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem |
-
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A., (2018)
-
Pinto, Leizer Lima, (2010)
-
Shen, Siqian, (2015)
- More ...
-
On a relaxed maximally disjoint path pair problem : a bicriteria approach
Pascoal, Marta M. B., (2019)
-
The pipeline and valve location problem
Laporte, Gilbert, (2012)
-
Finding non-dominated bicriteria shortest pairs of disjoint simple paths
Climaco, João, (2009)
- More ...