Strongly NP-complete problems

operations research problem of packing items into the fewest bins

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