| 000 | 01727cam a2200337 a 4500 | ||
|---|---|---|---|
| 003 | EG-GiCUC | ||
| 005 | 20250223030912.0 | ||
| 008 | 131211s2013 ua f m 000 0 eng d | ||
| 040 |
_aEG-GiCUC _beng _cEG-GiCUC |
||
| 041 | 0 | _aeng | |
| 049 | _aDeposite | ||
| 097 | _aM.Sc | ||
| 099 | _aCai01.20.02.M.Sc.2013.Am.U | ||
| 100 | 0 | _aAmgad Naiem Mortagy Abader | |
| 245 | 1 | 0 |
_aUsing parallel computation in solving the assignment problem / _cAmgad Naiem Mortagy ; Supervised Mohammed Adel Elbeltagy , Mohamed Hassan Rasmy |
| 246 | 1 | 5 | _aاستخدام الحساب المتوازى لحل مشكلة الإسناد |
| 260 |
_aCairo : _bAmgad Naiem Mortagy Abader , _c2013 |
||
| 300 |
_a75 Leaves ; _c25cm |
||
| 502 | _aThesis (M.Sc.) - Cairo University - Faculty of Computers and Information - Department of Opertion Research and Decision Support | ||
| 520 | _aThe assignment problem is one of the most famous problems in the field of combinatorial optimization. It affects many fields of real world applications nowadays, from personnel to tasks matching in a small workshop to scheduling of flights in airline industry. Due to its extreme importance a survey has been conducted to show a detailed review of literature on algorithms developed to solve the assignment problem, focusing on the state of art that have been reached so far in this area of study | ||
| 530 | _aIssued also as CD | ||
| 653 | 4 | _aAssignment | |
| 653 | 4 | _aAuction | |
| 653 | 4 | _aLinear assignment problems | |
| 700 | 0 |
_aMohamed Hassan Rasmy , _eSupervisor |
|
| 700 | 0 |
_aMohammed Adel Elbeltagy , _eSupervisor |
|
| 856 | _uhttp://172.23.153.220/th.pdf | ||
| 905 |
_aNazla _eRevisor |
||
| 905 |
_aSamia _eCataloger |
||
| 942 |
_2ddc _cTH |
||
| 999 |
_c44383 _d44383 |
||