Amcaoğlu, Beşir U2016-01-082016-01-081997http://hdl.handle.net/11693/17965Ankara : The Department of Industrial Engineering and Institute of Engineering and Sciences, Bilkent Univ., 1997.Thesis (Master's) -- Bilkent University, 1997.Includes bibliographical references leaves 31-33.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 (TSP) in an attempt to give a full description of the TSP polytope. In this study, we make use of these constraints in the context of the (Quadratic Assignment Problem (Q.AP). We discuss the relationships between the polytopes defined by the formulations with and without triangle constraints and we provide necessary and sufficient conditions for these constraints to give a full description of the QAP polytope. by-product of our analysis is that the triangle constraints suffice to define the QAP poly tope for n = 4.ix, 34 leavesEnglishinfo:eu-repo/semantics/openAccessThe Quadratic Assignment ProblemPolyhedral TheoryComputational ComplexityQA402.5 .A43 1997Quadratic Assignment Problem.Thesis