Pages that link to "Item:Q2480198"
From MaRDI portal
The following pages link to Greedy algorithm for the general multidimensional knapsack problem (Q2480198):
Displaying 15 items.
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm (Q342027) (← links)
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
- A total-value greedy heuristic for the integer knapsack problem (Q1200766) (← links)
- Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem (Q1730435) (← links)
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
- A RNN-based hyper-heuristic for combinatorial problems (Q2163777) (← links)
- A Stackelberg knapsack game with weight control (Q2333816) (← links)
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937) (← links)
- Optimal allocation of stock levels and stochastic customer demands to a capacitated resource (Q2393464) (← links)
- Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence (Q2855721) (← links)
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems (Q5870449) (← links)
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
- Optimal targeted mass screening in non‐uniform populations with multiple tests and schemes (Q6150228) (← links)
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack (Q6568952) (← links)
