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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) S. 81 - 85
1. Verfasser: Liu, Hongtao
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.12.2017
Schlagworte:
Approximation algorithms
Binary trees
Biobjective mixed integer programming
Branch and bound
Knapsack problem
Linear programming
Mathematical model
Mixed integer linear programming
Optimization
Upper bound
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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