An Exact Algorithm for the Biobjective 0-1 Linear Knapsack Problem with a Single Continuous Variable

In this paper, we study one variant of the multiobjective knapsack problem, i.e., the biobjective 0-1 linear knapsack problem with a single continuous variable (BKPC). An exact algorithm, the biobjective branch and bound method (BOBB), is presented to find all nondominated points of the BKPC. We ana...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) s. 81 - 85
Hlavný autor: Liu, Hongtao
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.12.2017
Predmet:
Approximation algorithms
Binary trees
Biobjective mixed integer programming
Branch and bound
Knapsack problem
Linear programming
Mathematical model
Mixed integer linear programming
Optimization
Upper bound
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we study one variant of the multiobjective knapsack problem, i.e., the biobjective 0-1 linear knapsack problem with a single continuous variable (BKPC). An exact algorithm, the biobjective branch and bound method (BOBB), is presented to find all nondominated points of the BKPC. We analyze the nondominated frontier of the BKPC and design a new branching strategy to improve the algorithm. Finally an illustrative example shows how the algorithm solves a practical problem.
DOI:10.1109/PDCAT.2017.00022