Show simple item record

dc.contributor.advisorAkgül, Mustafa
dc.contributor.authorEkin, Oya
dc.date.accessioned2020-12-02T12:52:18Z
dc.date.available2020-12-02T12:52:18Z
dc.date.submitted1990
dc.date.issued2018-08-06
dc.identifier.urihttps://acikbilim.yok.gov.tr/handle/20.500.12812/37484
dc.description.abstractÖZET DO?RUSAL ATAMA PROBLEMİNİN ÇÖZÜMÜNDE İKİ YENİ ALGORİTMA Oya Ekin Yöneylem Araştırması Bölümü Yüksek Lisans Tez Yöneticisi: Doç. Mustafa Akgül Ekim 1990 Doğrusal atama problemi, birleşi (combinatorial) eniyileme ve serim akım teorisinde en temel problemlerden biri olarak literatürde geniş kapsamda çalışılmıştır. Bu tez çalışmasında, atama problemini çözmek için iki yeni yaklaşım önerilmiştir. Birinci algoritmaikil uyarlılığı sürekli sağlar ve ağaçlar topluluğu ile çalışır. Çizgedeki batak noktaların derece dizimi belli bir özelliğe ulaşınca durulur. İkinci algoritma ise pivotsal bir algoritmadır. Anahtar Kelimeler: Atama problemi, ikil uyumlu ağaçlar.
dc.description.abstractABSTRACT TWO NEW ALGORITHMS FOR THE LINEAR ASSIGNMENT PROBLEM Oya Ekin M.S. in Operations Research Supervisor: Assoc. Prof. Mustafa Akgiil October 1990 The 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 practical 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... Keywords: Assignment problem, signature, stronly feasible tree. IVen_US
dc.languageEnglish
dc.language.isoen
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsAttribution 4.0 United Statestr_TR
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectMatematiktr_TR
dc.subjectMathematicsen_US
dc.titleTwo new algorithms for the linear assignment problem
dc.typemasterThesis
dc.date.updated2018-08-06
dc.contributor.departmentDiğer
dc.subject.ytmAlgorithms
dc.subject.ytmAssignment problem
dc.subject.ytmOperations research
dc.identifier.yokid11659
dc.publisher.instituteMühendislik ve Fen Bilimleri Enstitüsü
dc.publisher.universityİHSAN DOĞRAMACI BİLKENT ÜNİVERSİTESİ
dc.identifier.thesisid11659
dc.description.pages37
dc.publisher.disciplineDiğer


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess