A branch-and-bound algorithm for the mini-max spanning forest problem
Year of publication: |
1997
|
---|---|
Authors: | Yamada, T. ; Takahashi, H. ; Kataoka, S. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 101.1997, 1, p. 93-103
|
Saved in:
Saved in favorites
Similar items by person
-
A heuristic algorithm for the mini-max spanning forest problem
Yamada, T., (1996)
-
Upper and lower bounding procedures for minimum rooted k-subtree problem
Kataoka, S., (2000)
-
Minimum directed 1-subtree relaxation for score orienteering problem
Kataoka, S., (1998)
- More ...