A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem
Year of publication: |
2010
|
---|---|
Authors: | Santos, Marcelo ; Drummond, Lúcia M. A. ; Uchoa, Eduardo |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 38.2010, 1, p. 57-62
|
Subject: | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Branch-and-Bound | Branch and Bound |
-
A new exact maximum clique algorithm for large and massive sparse graphs
San Segundo, Pablo, (2016)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
- More ...
-
Scheduling Markovian PERT networks to maximize the net present value
Santos, Marcelo, (2010)
-
A distributed transportation simplex applied to a content distribution network problem
Coutinho, Rafaelli de C., (2014)
-
Levorato, Mario, (2017)
- More ...