Organization of the 19th ESICUP Meeting
Abstract
Several mathematical optimization algorithms are being developed for packing and cutting industrial materials. There are two prototypical problems addressed by this community, the Knapsack problem- Given n items, each having positive profit pj and weight wj, and a container (knapsack) with limited capacity c, select a subset of items with total weight not exceeding the capacity, so that the total profit of the selected items is maximized.the Bin Packing Problem (BPP)- Given n items, each having a weight wj , and an unlimited number of identical containers (bins) each with capacity c, pack all the items into the minimum number of bins so that the total weight packed in any bin does not exceed the capacity.
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Feb 22, 2024
- Source ID
- FA86552317001
Entities
People
- Michele Monaci
Organizations
- Air Force Office of Scientific Research
- United States Air Force