An application of the multiple knapsack problem: the self-sufficient marine

DOI10.1016/J.EJOR.2016.06.049zbMath1394.90498OpenAlexW2467869744MaRDI QIDQ1752270

Jay Simon, Aruna Apte, Eva Regnier

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.06.049

zbMATH Keywords

integer programmingmultiple knapsack problemOR in defensemarine corpsself-sufficiency

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Related Items (3)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ The assignment and loading transportation problem

Uses Software

• Knapsack
• GAMS
• MULKNAP

Cites Work

• Unnamed Item
• Unnamed Item
• An exact algorithm for large multiple knapsack problems
• A bound and bound algorithm for the zero-one multiple knapsack problem
• Adaptive memory search for multidemand multidimensional knapsack problems
• Balancing and optimizing a portfolio of R&D projects
• A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
• A survey of effective heuristics and their application to a variety of knapsack problems
• The Loading Problem
• Static competitive facility location: an overview of optimisation approaches.

This page was built for publication: An application of the multiple knapsack problem: the self-sufficient marine