![]() | ![]() |
| 1999 | ||
|---|---|---|
| 1 | Matthew J. Realff, P. H. Kvam, W. E. Taylor: Combined analytical and empirical learning framework for branch and bound algorithms: the knapsack problem. AI in Engineering 13(3): 287-300 (1999) | |
| 1 | Matthew J. Realff | [1] |
| 2 | W. E. Taylor | [1] |
Data released under the ODC-BY 1.0 license — See also our legal information page