Statements (31)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_optimization
|
| gptkbp:application |
logistics
manufacturing |
| gptkbp:category |
combinatorial optimization
resource allocation problem |
| gptkbp:field |
gptkb:mathematics
industrial engineering operations research |
| gptkbp:firstPublished |
1961
|
| gptkbp:formedBy |
Gilmore and Gomory
|
| gptkbp:generalizes |
gptkb:bin_packing_problem
|
| gptkbp:goal |
minimize waste
|
| gptkbp:hasVariant |
multi-dimensional cutting stock problem
two-dimensional cutting stock problem |
| gptkbp:relatedTo |
gptkb:knapsack_problem
gptkb:bin_packing_problem gptkb:vehicle_routing_problem linear programming integer programming one-dimensional cutting problem |
| gptkbp:solvedBy |
heuristics
column generation branch and price |
| gptkbp:usedIn |
gptkb:textile_industry
paper industry metal industry wood industry |
| gptkbp:bfsParent |
gptkb:Polyhedral_combinatorics
gptkb:bin_packing_problem |
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
cutting stock problem
|