Objective Method

Please enable javascript in your browser.

Rahimi, Fatemeh | 2016

1976 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 51538 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Haji Mirsadeghi, Mir Omid
Abstract:
In this thesis we introduce the objective method for solving combinatorial probability problems and combinatorial optimization. For introducing this method, we consider its application in solving problems such as graphs maximal partial matching problem. Then we introduce mean-field model, which has a close relationship with this method. Finally we use this method to discuss perfect mathching with minimal cost in complete graphs, and using obtaind theorems and concepts from solving this problem, like involution invariance and standard construction, we find an answer for random assigment problem, which is one of the most practical problems in the class of optimization problems
Keywords:
Object-Oriented Method ; Maximal Partial Matching ; Involution Invariance ; Standard Construction ; Stochastic Assignment Problem