On upper bounds for the multiple knapsack assignment problem

DOI10.1016/J.ORL.2024.107104MaRDI QIDQ6988664zbMATH OpenFDO

Authors Laura Galli, Adam N. Letchford

Publication date 3 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107104

zbMATH Keywords

combinatorial optimisationknapsack problemsmultiple assignment knapsack problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Cites work

• A Minimal Algorithm for the 0-1 Knapsack Problem
• A survey on the continuous nonlinear resource allocation problem
• An Algorithm for Large Zero-One Knapsack Problems
• Emergency relocation of items using single trips: special cases of the multiple knapsack assignment problem
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• The complexity of the 0/1 multi-knapsack problem
• Upper and lower bounding procedures for the multiple knapsack assignment problem

This page was built for publication: On upper bounds for the multiple knapsack assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988664)