Minimum directed 1-subtree relaxation for score orienteering problem
Year of publication: |
1998
|
---|---|
Authors: | Kataoka, Seiji ; Yamada, Takeo ; Morito, Susumu |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 104.1998, 1, p. 139-153
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
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)
-
Algorithms for the minimum spanning tree problem with resource allocation
Kataoka, Seiji, (2016)
- More ...