• Mathematics
  • Published 1992

Heuristic and exact algorithms for the quadratic assignment problem

@inproceedings{Li1992HeuristicAE,
  title={Heuristic and exact algorithms for the quadratic assignment problem},
  author={Yong Li},
  year={1992}
}
The quadratic assignment problem is a mathematical model arising from the facility location problem. As a classical combinatorial optimization problem, the quadratic assignment problem is N P-complete and includes the traveling salesman problem as a special case. Extensive research has been done on this problem for over 3 decades. However, the quadratic assignment problem still remains computationally very difficult to solve. To date, it is generally impractical to find the optimal solutions of… CONTINUE READING

Citations

Publications citing this paper.