Pages that link to "Item:Q3750525"
From MaRDI portal
The following pages link to A heuristic solution procedure for the multiconstraint zero-one knapsack problem (Q3750525):
Displaying 22 items.
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm (Q342027) (← links)
- 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)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← 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 efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← 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)
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators (Q1937869) (← links)
- Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
- A RNN-based hyper-heuristic for combinatorial problems (Q2163777) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- A new ant colony optimization algorithm for the multidimensional Knapsack problem (Q2471237) (← links)
- Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
- Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence (Q2855721) (← links)
- Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application (Q2954352) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)