Pages that link to "Item:Q5202507"
From MaRDI portal
The following pages link to An Improved Heuristic for Multidimensional 0-1 Knapsack Problems (Q5202507):
Displaying 26 items.
- 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)
- Heuristics for the general multiple non-linear knapsack problem (Q510935) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← 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)
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
- Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
- A complementary greedy heuristic for the knapsack problem (Q1203804) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem (Q1956060) (← links)
- A RNN-based hyper-heuristic for combinatorial problems (Q2163777) (← links)
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem (Q2427438) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem (Q2890459) (← links)
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem (Q3750525) (← links)
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach (Q3780001) (← links)
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) (← links)
- (Q5091235) (← links)
- Partial enumeration in heuristics for some combinatorial optimization problems (Q5292805) (← links)