Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:application |
resource allocation
load balancing memory management container loading |
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:describes |
packing objects of different sizes into a finite number of bins
|
| gptkbp:estimatedCost |
Best Fit algorithm
First Fit algorithm Next Fit algorithm |
| gptkbp:field |
computer science
operations research |
| gptkbp:firstDescribed |
1970s
|
| gptkbp:goal |
minimize the number of bins used
|
| gptkbp:hasExactAlgorithm |
dynamic programming
branch and bound |
| gptkbp:hasVariant |
gptkb:one-dimensional_bin_packing
three-dimensional bin packing two-dimensional bin packing |
| https://www.w3.org/2000/01/rdf-schema#label |
bin packing problem
|
| gptkbp:notableContributor |
gptkb:Edward_G._Coffman_Jr.
gptkb:David_S._Johnson |
| gptkbp:relatedTo |
gptkb:knapsack_problem
gptkb:cutting_stock_problem |
| gptkbp:bfsParent |
gptkb:knapsack_problem
gptkb:NP-hard_problems gptkb:Knapsack_problem gptkb:cutting_stock_problem |
| gptkbp:bfsLayer |
7
|