Pages that link to "Item:Q4021363"
From MaRDI portal
The following pages link to Tabu Search Applied to the Quadratic Assignment Problem (Q4021363):
Displaying 50 items.
- Fast local search for single row facility layout (Q319872) (← links)
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931) (← links)
- Variable neighborhood search for the workload balancing problem in service enterprises (Q337226) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965) (← links)
- Solving the quadratic assignment problem by the repeated iterated tabu search method (Q681911) (← links)
- Good solutions to discrete noxious location problems via metaheuristics (Q689250) (← links)
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP (Q689251) (← links)
- Comparison of the performance of modern heuristics for combinatorial optimization on real data (Q690010) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem (Q793639) (← links)
- QAPLIB-A quadratic assignment problem library (Q807376) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation (Q954934) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Simulated annealing and tabu search for multi-mode project payment scheduling (Q1042041) (← links)
- Heuristics for the dynamic facility layout problem with unequal-area departments (Q1044151) (← links)
- Backtracking of jobs in one-dimensional machine location problems (Q1127161) (← links)
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046) (← links)
- Recent models and techniques for solving the layout problem (Q1197682) (← links)
- Experimental analysis of simulated annealing based algorithms for the layout problem (Q1197688) (← links)
- Simulated annealing for machine layout problems in the presence of zoning constraints (Q1197690) (← links)
- A connectionist approach to the quadratic assignment problem (Q1200824) (← links)
- Generating quadratic assignment test problems with known optimal permutations (Q1203071) (← links)
- Optimizing tabu list size for the traveling salesman problem (Q1265842) (← links)
- Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes (Q1266662) (← links)
- A neural network approach to facility layout problems (Q1266731) (← links)
- Massively parallel analog tabu search using neural networks applied to simple plant location problems (Q1268165) (← links)
- Optimizing simulated annealing schedules with genetic programming (Q1268274) (← links)
- The life span method -- a new variant of local search (Q1275844) (← links)
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325) (← links)
- An efficient tabu search procedure for the \(p\)-median problem (Q1278496) (← links)
- Driving tabu search with case-based reasoning (Q1280158) (← links)
- Using tabu search to schedule activities of stochastic resource-constrained projects (Q1303749) (← links)
- A new global approach for \(0\)-\(1\) polynomial programs (Q1317077) (← links)
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks (Q1336877) (← links)
- Large-scale layout of facilities using a heuristic hybrid algorithm (Q1337243) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- Combinatorial optimization techniques for spacecraft scheduling automation (Q1339156) (← links)
- A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows (Q1342100) (← links)
- Extensions of a tabu search adaptation to the quadratic assignment problem (Q1342101) (← links)
- Applying tabu search with influential diversification to multiprocessor scheduling (Q1342105) (← links)
- A study of diversification strategies for the quadratic assignment problem (Q1342106) (← links)
- Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
