Now showing items 1-1 of 1

    • On the QAP polytope and a related inequality system 

      Amcaoğlu, Beşir U (Bilkent University, 1997)
      The Quadratic Assignment Problem is computationally one of the most dilficult NP-Hard problems. Recently, in 1996, Oguz introduced the so called ’triangle constraints’ into an extended model of the Travelling .Salesman problem ...