Pages that link to "Item:Q2255966"

The following pages link to Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966):

Displaying 15 items.

• An ejection chain approach for the quadratic multiple knapsack problem (Q323171) (← links)
• Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
• Planning personnel retraining: column generation heuristics (Q1631648) (← links)
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
• Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem (Q1705774) (← links)
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
• A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Iterated responsive threshold search for the quadratic multiple knapsack problem (Q2341207) (← links)
• Strategic oscillation for the quadratic multiple knapsack problem (Q2450910) (← links)
• A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems (Q2803836) (← links)
• Scheduling Personnel Retraining: Column Generation Heuristics (Q2835678) (← links)
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
• Lagrangian matheuristics for the quadratic multiple knapsack problem (Q6041829) (← links)
• Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)