Pages that link to "Item:Q4173192"
From MaRDI portal
The following pages link to Numerical investigations on quadratic assignment problems (Q4173192):
Displaying 47 items.
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- Quadratic assignment problems (Q594767) (← links)
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem (Q793639) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem (Q850313) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686) (← links)
- An exact algorithm for the general quadratic assignment problem (Q1067975) (← links)
- The facility layout problem (Q1088577) (← links)
- A heuristic method for the multi-story layout problem (Q1107411) (← links)
- Optimization of the movements of a component placement machine (Q1111924) (← links)
- Backtracking of jobs in one-dimensional machine location problems (Q1127161) (← links)
- Special cases of the quadratic assignment problem (Q1129914) (← links)
- An algorithm for quadratic assignment problems (Q1130047) (← links)
- Contributions to the quadratic assignment problem (Q1142700) (← links)
- On the quadratic assignment problem (Q1173009) (← links)
- Single and multiple period layout models for automated manufacturing systems (Q1175306) (← links)
- Integrating facility layout with process selection and capacity planning (Q1197685) (← links)
- A distance assignment approach to the facility layout problem (Q1197697) (← links)
- An algorithm for the quadratic assignment problem using Benders' decomposition (Q1247369) (← links)
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325) (← links)
- One-dimensional machine location problems in a multi-product flowline with equidistant locations (Q1291754) (← links)
- Move based heuristics for the unidirectional loop network layout problem (Q1295994) (← links)
- Strengthening Gilmore's bound for the quadratic assignment problem (Q1333480) (← links)
- Comment on ``The facility layout problem'' (Q1333526) (← links)
- Large-scale layout of facilities using a heuristic hybrid algorithm (Q1337243) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation (Q1609910) (← links)
- A mathematical model and a heuristic procedure for the turbine balancing problem (Q1804061) (← links)
- Directional decomposition heuristic for a linear machine-cell location problem. (Q1811151) (← links)
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem (Q1821011) (← links)
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems (Q1838910) (← links)
- Flow distance reduction for a multi-product flowline with sets of identical machines (Q1873007) (← links)
- Optimal sequences in stochastic single machine shops (Q1919778) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← links)
- A new heuristic for the linear placement problem (Q2276870) (← links)
- A hybrid heuristic for the facilities layout problem (Q2276871) (← links)
- A parallel heuristic for quadratic assignment problems (Q2276872) (← links)
- A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems (Q2565770) (← links)
- Parallel hybrid genetic algorithms for solving Q3AP on computational grid (Q2909213) (← links)
- Two-level modified simulated annealing based approach for solving facility layout problem (Q3498919) (← links)
- The asymptotic probabilistic behaviour of quadratic sum assignment problems (Q3668301) (← links)
- A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm (Q3754439) (← links)
- Sequential algorithm for the solution of problems of combinatorial optimization on permutations (Q3755239) (← links)
- A heuristic algorithm for the quadratic assignment formulation to the plant layout problem (Q3826336) (← links)
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme (Q4124641) (← links)
- A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem (Q4394217) (← links)