Upper and lower bounding procedures for the multiple knapsack assignment problem
Year of publication: |
2014
|
---|---|
Authors: | Kataoka, Seiji ; Yamada, Takeo |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 237.2014, 2, p. 440-447
|
Publisher: |
Elsevier |
Subject: | Combinatorial optimization | Heuristics | Multiple knapsack problem | Assignment problem | Lagrangian relaxation |
-
Upper and lower bounding procedures for the multiple knapsack assignment problem
Kataoka, Seiji, (2014)
-
Relaxation heuristics for the set multicover problem with generalized upper bound constraints
Umetani, Shunji, (2018)
-
Nishi, Tatsushi, (2017)
- More ...
-
Upper and lower bounding procedures for minimum rooted k-subtree problem
Kataoka, Seiji, (2000)
-
Some exact algorithms for the knapsack sharing problem
Yamada, Takeo, (1998)
-
A heuristic algorithm for the mini-max spanning forest problem
Yamada, Takeo, (1996)
- More ...