Back to Results
First PageMeta Content
NP-complete problems / Discrete geometry / Operations research / Combinatorial optimization / Bin packing problem / Generalized assignment problem / Knapsack problem / Packing problem / Strongly NP-complete / Theoretical computer science / Computational complexity theory / Mathematics


Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Add to Reading List

Document Date: 2009-08-06 19:20:44

Open Document

File Size: 340,41 KB

Share Result on Facebook
UPDATE