Combined analytical and empirical learning framework for branch and bound algorithms: the knapsack problem

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. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.