Pages that link to "Item:Q1908991"

The following pages link to Local search with memory: Benchmarking RTS (Q1908991):

Displaying 12 items.

• A Modified Binary Particle Swarm Optimization for Knapsack Problems (Q387477) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks (Q1336877) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
• Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
• The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization (Q1919839) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• The method of global equilibrium search (Q1968509) (← links)
• An ant colony optimization approach for the multidimensional knapsack problem (Q2267820) (← links)
• Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
• Memory and Learning in Metaheuristics (Q2866122) (← links)