Pages that link to "Item:Q1428288"
From MaRDI portal
The following pages link to A new heuristic for the quadratic assignment problem (Q1428288):
Displaying 19 items.
- Solving the quadratic assignment problem by the repeated iterated tabu search method (Q681911) (← links)
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem (Q793639) (← links)
- A new algorithm for the quasi-assignment problem (Q808992) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- Heuristics for biquadratic assignment problems and their computational comparison (Q1388822) (← links)
- A new form of the quadratic assignment problem and approximate solutions (Q1407127) (← links)
- A heuristic method for the quadratic assignment problem (Q1429397) (← links)
- A tabu search algorithm for the quadratic assignment problem (Q1773110) (← links)
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem (Q1821011) (← links)
- Solving the quadratic assignment problem (Q2215269) (← links)
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632) (← links)
- Compounded genetic algorithms for the quadratic assignment problem (Q2488198) (← links)
- New variable-length data compression scheme for solution representation of meta-heuristics (Q2668691) (← links)
- A new genetic algorithm for the quadratic assignment problem (Q2884562) (← links)
- An ejection chain algorithm for the quadratic assignment problem (Q3057181) (← links)
- A branch-and-bound-based heuristic for solving the quadratic assignment problem (Q3694983) (← links)
- Redinv-SA: la simulated annealing for the quadratic assignment problem (Q4497871) (← links)