Heuristics for the general multiple non-linear knapsack problem
From MaRDI portal
Recommendations
- Heuristic algorithms for the general nonlinear separable knapsack problem
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
- scientific article; zbMATH DE number 1728442
- Heuristics for the 0-1 multidimensional knapsack problem
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
Cites work
Cited in
(6)- The problem of the compartmentalized knapsack: a proposal of three new heuristics
- Cooperative strategies for solving the bicriteria sparse multiple knapsack problem
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- Learning to sample initial solution for solving 0-1 discrete optimization problem by local search
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- Heuristic algorithms for the general nonlinear separable knapsack problem
This page was built for publication: Heuristics for the general multiple non-linear knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510935)