Show simple item record

dc.contributor.advisorTansel, Barbaros Ç.
dc.contributor.authorErdoğan, Güneş
dc.date.accessioned2016-07-01T11:08:42Z
dc.date.available2016-07-01T11:08:42Z
dc.date.issued2006
dc.identifier.urihttp://hdl.handle.net/11693/29917
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractThe Quadratic Assignment Problem (QAP) is one of the hardest combinatorial optimization problems known. Exact solution attempts proposed for instances of size larger than 15 have been generally unsuccessful even though successful implementations have been reported on some test problems from the QAPLIB up to size 36. In this dissertation, we analyze the binary structure of the QAP and present new IP formulations. We focus on “flow-based” formulations, strengthen the formulations with valid inequalities, and report computational experience with a branch-and-cut algorithm. Next, we present new classes of instances of the QAP that can be completely or partially reduced to the Linear Assignment Problem and give procedures to check whether or not an instance is an element of one of these classes. We also identify classes of instances of the Koopmans-Beckmann form of the QAP that are solvable in polynomial time. Lastly, we present a strong lower bound based on Bender’s decomposition.en_US
dc.description.statementofresponsibilityErdoğan, Güneşen_US
dc.format.extentx, 124 leaves, tablesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectQuadratic Assignment Problemen_US
dc.subjectLinearizationen_US
dc.subjectComputational Complexityen_US
dc.subjectPolynomial Time Solvabilityen_US
dc.subject.lccQA402.5 .E73 2006en_US
dc.subject.lcshProgramming (Mathematics)en_US
dc.titleQuadratic assignment problem : linearizations and polynomial time solvable casesen_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreePh.D.en_US
dc.identifier.itemidBILKUTUPB100751


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record