Algorithms for the minimum spanning tree problem with resource allocation
Year of publication: |
2016
|
---|---|
Authors: | Kataoka, Seiji ; Yamada, Takeo |
Published in: |
Operations Research Perspectives. - Amsterdam : Elsevier, ISSN 2214-7160. - Vol. 3.2016, p. 5-13
|
Publisher: |
Amsterdam : Elsevier |
Subject: | Minimum spanning tree problem | Resource allocation | Trade-off analysis | Branch-and-bound method |
-
Algorithms for the minimum spanning tree problem with resource allocation
Kataoka, Seiji, (2016)
-
Lacour, Renaud, (2014)
-
Solving Hop-constrained MST problems with ACO
Monteiro, Marta S.R., (2013)
- More ...
-
Upper and lower bounding procedures for the multiple knapsack assignment problem
Kataoka, Seiji, (2014)
-
Some exact algorithms for the knapsack sharing problem
Yamada, Takeo, (1998)
-
Upper and lower bounding procedures for minimum rooted k-subtree problem
Kataoka, Seiji, (2000)
- More ...