Show simple item record

dc.contributor.advisorTansel, Ç. Barbaros
dc.contributor.authorAmcaoğlu, Beşir U
dc.date.accessioned2016-01-08T20:14:57Z
dc.date.available2016-01-08T20:14:57Z
dc.date.issued1997
dc.identifier.urihttp://hdl.handle.net/11693/17965
dc.descriptionAnkara : The Department of Industrial Engineering and Institute of Engineering and Sciences, Bilkent Univ., 1997.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1997.en_US
dc.descriptionIncludes bibliographical references leaves 31-33.en_US
dc.description.abstractThe 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.en_US
dc.description.statementofresponsibilityAmcaoğlu, Beşir Uen_US
dc.format.extentix, 34 leavesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectThe Quadratic Assignment Problemen_US
dc.subjectPolyhedral Theoryen_US
dc.subjectComputational Complexityen_US
dc.subject.lccQA402.5 .A43 1997en_US
dc.subject.lcshQuadratic Assignment Problem.en_US
dc.titleOn the QAP polytope and a related inequality systemen_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record