BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385040)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5269119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) |
scientific article; zbMATH DE number 5269119 |
Statements
BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (English)
0 references
29 April 2008
0 references
discrete optimization
0 references
automated food packing
0 references
0-1 knapsack problem
0 references
dynamic programming
0 references
0.7751143574714661
0 references
0.7127975225448608
0 references
0.7080188989639282
0 references
0.7075616717338562
0 references
0.7038986682891846
0 references
