header
Local cover image
Local cover image
Image from OpenLibrary

A hybrid intelligent approach to solve multiple-choice problems / Ashraf Farouk Sayed Ahmed Heikal ; Supervised Mohammed Hassan Rasmy , Assem Abdelfatah Tharwat , Mohammed Adel Elbeltagy

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cairo : Ashraf Farouk Sayed Ahmed Heikal , 2012Description: 171 Leaves : charts ; 30cmOther title:
  • طريقة مهجنة ذكيه لحل المشاكل متعددة الاختيارات [Added title page title]
Subject(s): Online resources: Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (Ph.D.) - Cairo University - Faculty of Computers and Information - Department of Operation Research and Decision Support Summary: Multiple 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
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.20.02.Ph.D.2012.As.H (Browse shelf(Opens below)) Not for loan 01010110059144000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.20.02.Ph.D.2012.As.H (Browse shelf(Opens below)) 59144.CD Not for loan 01020110059144000

Thesis (Ph.D.) - Cairo University - Faculty of Computers and Information - Department of Operation Research and Decision Support

Multiple 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

Issued also as CD

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

Local cover image