Pages that link to "Item:Q706997"
From MaRDI portal
The following pages link to Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997):
Displaying 8 items.
- A Modified Binary Particle Swarm Optimization for Knapsack Problems (Q387477) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints (Q1781556) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems (Q2371518) (← links)
