Pages that link to "Item:Q5728874"
From MaRDI portal
The following pages link to Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem (Q5728874):
Displaying 50 items.
- Lower bounding procedures for the single allocation hub location problem (Q325391) (← links)
- Variable neighborhood search for the workload balancing problem in service enterprises (Q337226) (← links)
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← links)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem (Q510938) (← links)
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
- Quadratic assignment problems (Q594767) (← links)
- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing (Q703914) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem (Q842713) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Generating QAP instances with known optimum solution and additively decomposable cost function (Q887857) (← links)
- Convergence of a modified algorithm of fast probabilistic modeling (Q946727) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- An exact algorithm for the general quadratic assignment problem (Q1067975) (← links)
- The facility layout problem (Q1088577) (← links)
- A parallel branch and bound algorithm for the quadratic assignment problem (Q1095791) (← links)
- A heuristic method for the multi-story layout problem (Q1107411) (← links)
- An algorithm for quadratic assignment problems (Q1130047) (← links)
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079) (← links)
- Contributions to the quadratic assignment problem (Q1142700) (← links)
- A branch and bound algorithm for the acyclic subgraph problem (Q1154950) (← links)
- A heuristic procedure for solving the quadratic assignment problem (Q1158105) (← links)
- On the quadratic assignment problem (Q1173009) (← links)
- Single and multiple period layout models for automated manufacturing systems (Q1175306) (← links)
- A location problem on unicyclic networks: Balanced case (Q1196028) (← links)
- Simulated annealing for machine layout problems in the presence of zoning constraints (Q1197690) (← links)
- Layout design for flexible manufacturing systems (Q1197691) (← links)
- A distance assignment approach to the facility layout problem (Q1197697) (← links)
- Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem (Q1197698) (← links)
- Generating quadratic assignment test problems with known optimal permutations (Q1203071) (← links)
- Algorithms for robust single and multiple period layout planning for manufacturing systems (Q1205706) (← links)
- An algorithm for the quadratic assignment problem using Benders' decomposition (Q1247369) (← links)
- A neural network approach to facility layout problems (Q1266731) (← links)
- Optimizing simulated annealing schedules with genetic programming (Q1268274) (← links)
- Network-based formulations of the quadratic assignment problem (Q1291651) (← links)
- Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
- An optimal tree search method for the manufacturing systems cell formation problem (Q1291773) (← links)
- Move based heuristics for the unidirectional loop network layout problem (Q1295994) (← links)
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
- A variant of time minimizing assignment problem (Q1303581) (← links)
