An application of the multiple knapsack problem: the self-sufficient marine
From MaRDI portal
Publication:1752270
Recommendations
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem
- Evaluation of a USMC combat service support logistics concept
- The assignment and loading transportation problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
Cites work
- A bound and bound algorithm for the zero-one multiple knapsack problem
- 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
- Adaptive memory search for multidemand multidimensional knapsack problems
- An exact algorithm for large multiple knapsack problems
- Balancing and optimizing a portfolio of R&D projects
- scientific article; zbMATH DE number 5282967 (Why is no real title available?)
- scientific article; zbMATH DE number 3769296 (Why is no real title available?)
- Static competitive facility location: an overview of optimisation approaches.
- The Loading Problem
Cited in
(4)- Mathematical models and decomposition methods for the multiple knapsack problem
- The assignment and loading transportation problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Discrete Fick's law algorithm with new transfer function and aggregation optimization strategy for solving multiple knapsack problem
This page was built for publication: An application of the multiple knapsack problem: the self-sufficient marine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752270)