Bin covering problem
id:
bin-covering-problem-191-13026046
title:
Bin covering problem
text:
In the bin covering problem, items of different sizes must be packed into a finite number of bins or containers, each of which must contain at least a certain given total size, in a way that maximizes the number of bins used. This problem is a dual of the bin packing problem: in bin covering, the bin sizes are bounded from below and the goal is to maximize their number; in bin packing, the bin sizes are bounded from above and the goal is to minimize their number. The problem is NP-hard, but ther
brand slug:
wiki
category slug:
encyclopedia
description:
Operations research problem of packing items into the largest number of bins
original url:
https://en.wikipedia.org/wiki/Bin_covering_problem
date created:
date modified:
2024-02-24T20:15:15Z
main entity:
{"identifier":"Q104872067","url":"https://www.wikidata.org/entity/Q104872067"}
image:
fields total:
13
integrity:
14