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)

zbMATH Keywords

combinatorial optimisationknapsack problemsmultiple assignment knapsack problem

Mathematics Subject Classification ID

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

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)