The following pages link to (Q4350063):
Displaying 43 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)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- A combined parallel algorithm for solving the knapsack problem (Q734010) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← links)
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476) (← links)
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search (Q953317) (← links)
- Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
- Simple and fast surrogate constraint heuristics for the maximum independent set problem (Q1009195) (← links)
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
- Constructing efficient simulated annealing algorithms (Q1364480) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Nurse scheduling with tabu search and strategic oscillation (Q1609902) (← links)
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
- An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem (Q1616250) (← links)
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- A self-guided genetic algorithm for permutation flowshop scheduling problems (Q1762134) (← links)
- Improved results on the 0--1 multidimensional knapsack problem (Q1776956) (← links)
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints (Q1781556) (← links)
- Adaptive memory search for Boolean optimization problems (Q1878405) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Heuristic methods for evolutionary computation techniques (Q1922636) (← links)
- Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems'' (Q2184176) (← links)
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
- An ant colony optimization approach for the multidimensional knapsack problem (Q2267820) (← links)
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- Adaptive memory search for multidemand multidimensional knapsack problems (Q2489302) (← links)
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management (Q2496020) (← links)
- Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List (Q2773172) (← links)
- CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem (Q2815454) (← links)
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) (← links)
- Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method (Q6123149) (← links)
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis (Q6551077) (← links)
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack (Q6568952) (← links)
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets (Q6667807) (← links)
