| 000 | 01808cam a2200349 a 4500 | ||
|---|---|---|---|
| 003 | EG-GiCUC | ||
| 005 | 20250223030734.0 | ||
| 008 | 130106s2012 ua d f m 000 0 eng d | ||
| 040 |
_aEG-GiCUC _beng _cEG-GiCUC |
||
| 041 | 0 | _aeng | |
| 049 | _aDeposite | ||
| 097 | _aPh.D | ||
| 099 | _aCai01.20.02.Ph.D.2012.As.H | ||
| 100 | 0 | _aAshraf Farouk Sayed Ahmed Heikal | |
| 245 | 1 | 2 |
_aA hybrid intelligent approach to solve multiple-choice problems / _cAshraf Farouk Sayed Ahmed Heikal ; Supervised Mohammed Hassan Rasmy , Assem Abdelfatah Tharwat , Mohammed Adel Elbeltagy |
| 246 | 1 | 5 | _aطريقة مهجنة ذكيه لحل المشاكل متعددة الاختيارات |
| 260 |
_aCairo : _bAshraf Farouk Sayed Ahmed Heikal , _c2012 |
||
| 300 |
_a171 Leaves : _bcharts ; _c30cm |
||
| 502 | _aThesis (Ph.D.) - Cairo University - Faculty of Computers and Information - Department of Operation Research and Decision Support | ||
| 520 | _aMultiple choice problems (MCPs) belong to a class of combinatorial problems with a requirement to choose, among several possible combinations, an alternative to optimize an objective function and, at the same time, satisfy a set of constraints. This research focuses on the multiple-choice multidimensional knapsack problem (MMKP) which could be seen as a multiple choice mixed integer programming (MCIP) problem | ||
| 530 | _aIssued also as CD | ||
| 653 | 4 | _aKanapsack problem | |
| 653 | 4 | _aMultiple-choice multidimensional | |
| 653 | 4 | _aMultiple-choice problems | |
| 700 | 0 |
_aAssem Abdelfatah Tharwat , _eSupervisor |
|
| 700 | 0 |
_aMohammed Adel Elbeltagy , _eSupervisor |
|
| 700 | 0 |
_aMohammed Hassan Rasmy , _eSupervisor |
|
| 856 | _uhttp://172.23.153.220/th.pdf | ||
| 905 |
_aNazla _eRevisor |
||
| 905 |
_aSamia _eCataloger |
||
| 942 |
_2ddc _cTH |
||
| 999 |
_c40926 _d40926 |
||