Show simple item record

dc.contributor.advisorAkgül, Mustafa
dc.contributor.authorEkin, Oya
dc.date.accessioned2016-01-08T20:08:42Z
dc.date.available2016-01-08T20:08:42Z
dc.date.issued1990
dc.identifier.urihttp://hdl.handle.net/11693/17265
dc.descriptionAnkara : Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent University, 1990.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1990.en_US
dc.descriptionIncludes bibliographical references.en_US
dc.description.abstractThe linear assignment problem (AP) being among the first linear programming problems to be studied extensively,, is a fundamental problem in combinatorial optimization and network flow theory. AP arises in numerous applications of assigning personnel to jobs, assigning facilities to locations, sequencing jobs, scheduling flights, project planning and a variety of other practica.1 problems in logistics planning. In this thesis work, we seek for new approaches for solving the linear assignment problem. The main concern is to develop solution methods that exhibit some sort of parallelism. We present two new approaches for solving the assignment problem : A dual-feasible signature guided forest algorithm and a criss-cross like algorithm.en_US
dc.description.statementofresponsibilityEkin, Oyaen_US
dc.format.extentvii, 37pagesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectAssignment problemen_US
dc.subjectsignatureen_US
dc.subjectstronly feasible treeen_US
dc.subject.lccQA402.5 .E35 1990en_US
dc.subject.lcshProgramming (Mathematics).en_US
dc.subject.lcshQuadratic assignment problem.en_US
dc.titleTwo new algorithms for the linear assignment problemen_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