Pages that link to "Item:Q789318"
From MaRDI portal
The following pages link to A heuristic algorithm for the multidimensional zero-one knapsack problem (Q789318):
Displaying 20 items.
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems (Q443043) (← links)
- Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476) (← links)
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
- Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights (Q965587) (← links)
- A simulated annealing approach to the multiconstraint zero-one knapsack problem (Q1099588) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- Towards the real time solution of strike force asset allocation problems (Q1765539) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem (Q1956060) (← links)
- Complexity indices for the multidimensional knapsack problem (Q2045626) (← links)
- A RNN-based hyper-heuristic for combinatorial problems (Q2163777) (← links)
- Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms (Q2456412) (← links)
- Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)