The QAP-polytope and the star transformation

  title={The QAP-polytope and the star transformation},
  author={Michael J{\"u}nger and Volker Kaibel},
  journal={Discrete Applied Mathematics},
The quadratic assignment problem (QAP) maybe was for a long time the one among the prominent NP-hard combinatorial optimization problems about which the fewest polyhedral results had been known. Recent work of Rijal (1995) and Padberg and Rijal (1996) has on the one hand yielded some basic facts about the associated quadratic assignment polytope, but has on the other hand shown that \naive" investigations even of the very basic questions (like the dimension, the aane hull, and the trivial… CONTINUE READING