Revisiting dynamic programming for finding optimal subtrees in trees
Year of publication: |
2007
|
---|---|
Authors: | Blum, Christian |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 177.2007, 1, p. 102-115
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Minimum common string partition: on solving large-scale problem instances
Blum, Christian, (2018)
-
Mathematical programming strategies for solving the minimum common string partition problem
Blum, Christian, (2015)
-
Beam-ACO for Simple Assembly Line Balancing
Blum, Christian, (2008)
- More ...