A strongly polynomial algorithm for the minimum maximum flow degree problem
Year of publication: |
2023
|
---|---|
Authors: | Campêlo, Manoel ; Matias, Jhonata |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 51.2023, 1, p. 67-71
|
Subject: | Flow coloring problem | Linear Programming | Minimum maximum flow degree problem | Network flow | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Optimizing Safe Routes to School
Brachman, Micah L., (2019)
-
Two product, two region production, inventory, and transportation problems
Lee, Jong Hyup, (2014)
-
Multiechelon lot sizing : new complexities and inequalities
Zhao, Ming, (2020)
- More ...
-
Two dependency constrained spanning tree problems
Viana, Luiz Alberto do Carmo, (2019)
-
Heuristics for the connected assignment problem in arrays
Campêlo, Manoel, (2019)
-
The sociotechnical teams formation problem : a mathematical optimization approach
Campêlo, Manoel, (2020)
- More ...