Models and algorithms for large-size knapsack problems
Abstract
We plan to study variants of single and multiple knapsack problems that arise in real-worldapplications in which large amounts of data must be processed. The research group hasbeen particularly active in the knapsack problem area since the Seventies. In more recent years, severalknapsack problem variants have been addressed, and a number of scientific publicationshas been produced. In the proposed project, we intend to investigate the following topics:(i) multiple knapsack problems in which the involved functions are non-linear, by ex-tending the results obtained by the group for the single non-linear case [1];(ii) single knapsack and packing problems in which the input items are partitioned intogroups, and additional cardinality constraints are imposed.
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Feb 06, 2017
- Source ID
- FA95501710067
Entities
People
- Silvano Martello
Organizations
- Air Force Office of Scientific Research
- United States Air Force