QA505 : Some Algorithms For Solving Multi Objective Knapsack Problem
Thesis > Central Library of Shahrood University > Mathematical Sciences > MSc > 2018
Authors:
Abstarct: In this thesis, we propose a new procedure baxsed on linear mathematical programming formulation to find all efficient solutions of bi-objective 0-1 knapsack problem. We solve a limited number of single objective problems to find efficient solutions of bi-objective 0-1 knapsack problem. In the end, algorithms have been developed to solve the multi-objective knapsack problem.
Keywords:
#Bi-objective 0-1 knapsack problem #Multi-objectove knapsack problem #Ant Colony Optimization #Scatter Search Link
Keeping place: Central Library of Shahrood University
Visitor:
Keeping place: Central Library of Shahrood University
Visitor:
