An extreme point algorithm for a local minimum solution to the quadratic assignment problem
From MaRDI portal
(Redirected from Publication:1877896)
Recommendations
- Polynomial algorithms for solving the quadratic assignment problem on networks
- scientific article; zbMATH DE number 1203226
- Recent advances in the solution of quadratic assignment problems
- scientific article; zbMATH DE number 1302195
- A new exact algorithm for the solution of quadratic assignment problems
Cites work
- A genetic approach to the quadratic assignment problem
- A neural network approach to facility layout problems
- A parallel branch and bound algorithm for the quadratic assignment problem
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Assignment Problems and the Location of Economic Activities
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Extensions of a tabu search adaptation to the quadratic assignment problem
- scientific article; zbMATH DE number 714533 (Why is no real title available?)
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- P-Complete Approximation Problems
- QAPLIB - a quadratic assignment problem library
- Simple approaches to parallel branch and bound
- Solving large quadratic assignment problems in parallel
- Tabu Search Applied to the Quadratic Assignment Problem
- The alternating basis algorithm for assignment problems
- The Reactive Tabu Search
Cited in
(4)
This page was built for publication: An extreme point algorithm for a local minimum solution to the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877896)