Pages that link to "Item:Q2341207"
From MaRDI portal
The following pages link to Iterated responsive threshold search for the quadratic multiple knapsack problem (Q2341207):
Displaying 13 items.
- A three-phased local search approach for the clique partitioning problem (Q306093) (← 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)
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) (← 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)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← 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)
- Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering (Q6071251) (← links)