Category

Strongly NP-complete problems

page 1

bin packing problem

operations research problem of packing items into the fewest bins

strong NP-completeness

property of computational problems that is a special case of NP-completeness