Pages that link to "Item:Q2892376"
From MaRDI portal
The following pages link to Very large-scale neighborhood search for the quadratic assignment problem (Q2892376):
Displaying 17 items.
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- Cyclic transfers in school timetabling (Q421072) (← links)
- Constraint-based very large-scale neighborhood search (Q434452) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
- Solving large quadratic assignment problems on computational grids (Q1849534) (← links)
- Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
- Breakout local search for the quadratic assignment problem (Q2350189) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- An ejection chain algorithm for the quadratic assignment problem (Q3057181) (← links)
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
- A New Neighborhood for the QAP (Q3503523) (← links)
- VLSN search algorithms for partitioning problems using matching neighbourhoods (Q3515505) (← links)
- An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← links)
