Finding extreme supported solutions of biobjective network flow problems : an enhanced parametric programming approach
Year of publication: |
June 2017
|
---|---|
Authors: | Raith, Andrea ; Sedeño-Noda, Antonio |
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. 82.2017, p. 153-166
|
Subject: | Biobjective minimum cost flow problem | Extreme supported efficient solutions | Network flow algorithm | Parametric simplex method | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Netzplantechnik | Project network techniques | Algorithmus | Algorithm | Projektmanagement | Project management |
-
A hybrid algorithm for solving convex separable network flow problems
Belling-Seib, Katharina, (1983)
-
A simplex algorithm for network flow problems with piecewise linear fractional objective function
Pandey, Pooja, (2009)
-
A primal-dual simplex algorithm for bi-objective network flow problems
Eusébio, Augusto, (2009)
- More ...
-
Sedeño-Noda, Antonio, (2015)
-
Enumerating K best paths in length order in DAGs
Pascoal, Marta M.B., (2012)
-
Fast and fine quickest path algorithm
Sedeño-Noda, Antonio, (2014)
- More ...