Show simple item record

dc.contributor.advisorAkgül, Mustafaen_US
dc.contributor.authorAtamtürk, Alperen_US
dc.date.accessioned2016-01-08T20:10:16Z
dc.date.available2016-01-08T20:10:16Z
dc.date.issued1993
dc.identifier.urihttp://hdl.handle.net/11693/17433
dc.descriptionAnkara : Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 1993.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1993en_US
dc.descriptionIncludes bibliographical refences.en_US
dc.description.abstractThe minimum cost perfect matching problem is one of the rare combinatorial optimization problems for which polynomial time algorithms exist. Matching algorithms find applications in Postman Problem, Planar Multicommodity Flow Problem, in heuristics to the well known Traveling Salesman Problem, Vehicle Scheduling Problem, Graph Partitioning Problem, Set Partitioning Problem, in VLSI, et cetera. In this thesis, reviewing the existing primal-dual approaches in the literature, we present two efficient algorithms for the minimum cost perfect matching problem on general graphs. In both of the algorithms, we achieved drastic reductions in the total number of time consuming operations such as scanning, updating dual variables and reduced costs. Detailed computational analysis on randomly generated graphs has shown the proposed algorithms to be several times faster than other algorithms in the literature. Hence, we conjecture that employment of the new algorithms in the solution methods of above stated important problems would speed them up significantly.en_US
dc.description.statementofresponsibilityAtamtürk, Alperen_US
dc.format.extentix, 55 leavesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectMinimum Cost Perfect Matching Problemen_US
dc.subjectPrimal-dual Algorithmsen_US
dc.subjectBlossom Algorithmen_US
dc.subjectFibonacci Heapsen_US
dc.subject.lccQA166 .A73 1993en_US
dc.subject.lcshGraph theory.en_US
dc.subject.lcshComputer algorithms.en_US
dc.titleEfficient algorithms for the minimum cost perfect matching problem on general graphsen_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