Numerical investigations on quadratic assignment problems
From MaRDI portal
Publication:4173192
Cites work
Cited in
(47)- An algorithm for the quadratic assignment problem using Benders' decomposition
- RLT insights into lift-and-project closures
- Special cases of the quadratic assignment problem
- The asymptotic probabilistic behaviour of quadratic sum assignment problems
- A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem
- Parallel hybrid genetic algorithms for solving Q3AP on computational grid
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- Global optimality conditions and optimization methods for quadratic assignment problems
- Move based heuristics for the unidirectional loop network layout problem
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A survey for the quadratic assignment problem
- Large-scale layout of facilities using a heuristic hybrid algorithm
- Strengthening Gilmore's bound for the quadratic assignment problem
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- On the quadratic assignment problem
- A hybrid heuristic for the facilities layout problem
- A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- A parallel heuristic for quadratic assignment problems
- Comment on ``The facility layout problem
- A heuristic method for the multi-story layout problem
- The facility layout problem
- An algorithm for quadratic assignment problems
- Backtracking of jobs in one-dimensional machine location problems
- Single and multiple period layout models for automated manufacturing systems
- Optimal sequences in stochastic single machine shops
- A mathematical model and a heuristic procedure for the turbine balancing problem
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- Optimization of the movements of a component placement machine
- A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem
- Directional decomposition heuristic for a linear machine-cell location problem.
- Flow distance reduction for a multi-product flowline with sets of identical machines
- A distance assignment approach to the facility layout problem
- Integrating facility layout with process selection and capacity planning
- Sequential algorithm for the solution of problems of combinatorial optimization on permutations
- Two-level modified simulated annealing based approach for solving facility layout problem
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- A new heuristic for the linear placement problem
- Contributions to the quadratic assignment problem
- A heuristic algorithm for the quadratic assignment formulation to the plant layout problem
- Quadratic assignment problems
- An exact algorithm for the general quadratic assignment problem
- A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems
- Lower bounds for the quadratic assignment problem
This page was built for publication: Numerical investigations on quadratic assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4173192)
