NIST

UB

(classic problem)

Definition: See unbounded knapsack problem.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 27 September 2013.
HTML page formatted Mon Feb 2 13:10:40 2015.

Cite this as:
Paul E. Black, "UB", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 27 September 2013. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/ub.html