An extreme point algorithm for a local minimum solution to the quadratic assignment problem
From MaRDI portal
Publication:1877896
DOI10.1016/S0377-2217(03)00132-2zbMath1056.90013OpenAlexW2023479260MaRDI QIDQ1877896
Chawki A. Fedjki, S. O. Duffuaa
Publication date: 19 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00132-2
Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (3)
A hybrid biased random key genetic algorithm for the quadratic assignment problem ⋮ A survey for the quadratic assignment problem ⋮ Detailed layout planning for irregularly-shaped machines with transportation path design
Uses Software
Cites Work
- Unnamed Item
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- A parallel branch and bound algorithm for the quadratic assignment problem
- Simple approaches to parallel branch and bound
- An algorithm for the quadratic assignment problem using Benders' decomposition
- A neural network approach to facility layout problems
- Extensions of a tabu search adaptation to the quadratic assignment problem
- A genetic approach to the quadratic assignment problem
- QAPLIB - a quadratic assignment problem library
- Solving large quadratic assignment problems in parallel
- Assignment Problems and the Location of Economic Activities
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- Tabu Search Applied to the Quadratic Assignment Problem
- P-Complete Approximation Problems
- The alternating basis algorithm for assignment problems
- The Reactive Tabu Search
This page was built for publication: An extreme point algorithm for a local minimum solution to the quadratic assignment problem
