Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

You searched for id:"oai:https://zone.biblio.laurentian.ca:10219/2762". One record found.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Laurentian University

1. Shamakhai, Hayat Abdullah. The 0 -1 multiple knapsack problem .

Degree: 2017, Laurentian University

In operation research, the Multiple Knapsack Problem (MKP) is classified as a combinatorial optimization problem. It is a particular case of the Generalized Assignment Problem. The MKP has been applied to many applications in naval as well as financial management. There are several methods to solve the Knapsack Problem (KP) and Multiple Knapsack Problem (MKP); in particular the Bound and Bound Algorithm (B&B). The bound and bound method is a modification of the Branch and Bound Algorithm which is defined as a particular tree-search technique for the integer linear programming. It has been used to obtain an optimal solution. In this research, we provide a new approach called the Adapted Transportation Algorithm (ATA) to solve the KP and MKP. The solution results of these methods are presented in this thesis. The Adapted Transportation Algorithm is applied to solve the Multiple Knapsack Problem where the unit profit of the items is dependent on the knapsack. In addition, we will show the link between the Multiple Knapsack Problem (MKP) and the multiple Assignment Problem (MAP). These results open a new field of research in order to solve KP and MKP by using the algorithms developed in transportation.

Subjects/Keywords: generalized assignment problem; assignment problem; knapsack problem; multiple knapsack problem; branch and bound algorithm; bound and bound algorithm; transportation problem; multiple assignment problem; adapted transportation problem; vogel approximation method; group role assignment problem.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shamakhai, H. A. (2017). The 0 -1 multiple knapsack problem . (Thesis). Laurentian University. Retrieved from https://zone.biblio.laurentian.ca/handle/10219/2762

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Shamakhai, Hayat Abdullah. “The 0 -1 multiple knapsack problem .” 2017. Thesis, Laurentian University. Accessed December 18, 2017. https://zone.biblio.laurentian.ca/handle/10219/2762.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Shamakhai, Hayat Abdullah. “The 0 -1 multiple knapsack problem .” 2017. Web. 18 Dec 2017.

Vancouver:

Shamakhai HA. The 0 -1 multiple knapsack problem . [Internet] [Thesis]. Laurentian University; 2017. [cited 2017 Dec 18]. Available from: https://zone.biblio.laurentian.ca/handle/10219/2762.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shamakhai HA. The 0 -1 multiple knapsack problem . [Thesis]. Laurentian University; 2017. Available from: https://zone.biblio.laurentian.ca/handle/10219/2762

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.