The minmax multidimensional knapsack problem with application to a chance‐constrained problem

DOI10.1002/nav.20237zbMath1151.90529OpenAlexW2151391944MaRDI QIDQ5438265

Moshe Kress, Maria Polukarov, Michal Penn

Publication date: 23 January 2008

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20237

zbMATH Keywords

knapsack problemcombinatorial algorithmchance constraintsmilitary logisticsrecourse

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (4)

Cutting and packing problems under uncertainty: literature review and classification framework ⋮ Complexity results and exact algorithms for robust knapsack problems ⋮ Cell-and-bound algorithm for chance constrained programs with discrete distributions ⋮ Mathematical programming approaches for generating \(p\)-efficient points

This page was built for publication: The minmax multidimensional knapsack problem with application to a chance‐constrained problem