Numerical investigations on quadratic assignment problems
DOI10.1002/NAV.3800250111zbMATH Open0391.90066OpenAlexW2113135226MaRDI QIDQ4173192FDOQ4173192
Authors: Rainer E. Burkard, Karl-Heinz Stratmann
Publication date: 1978
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800250111
Computational EfficiencyPerturbation MethodBranch and Bound AlgorithmBottleneck ProblemsNumerical InvestigationsQuadratic Assignment ProblemsSuboptimal Solutions
Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)
Cites Work
Cited In (47)
- RLT insights into lift-and-project closures
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Special cases of the quadratic assignment problem
- The asymptotic probabilistic behaviour of quadratic sum assignment problems
- Parallel hybrid genetic algorithms for solving Q3AP on computational grid
- A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem
- 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
- 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
- On the quadratic assignment problem
- 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
- Optimal sequences in stochastic single machine shops
- Single and multiple period layout models for automated manufacturing systems
- 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
- A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem
- Optimization of the movements of a component placement machine
- Directional decomposition heuristic for a linear machine-cell location problem.
- Sequential algorithm for the solution of problems of combinatorial optimization on permutations
- 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
- 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
- A heuristic algorithm for the quadratic assignment formulation to the plant layout problem
- Contributions to the quadratic assignment 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)