Exact algorithm for bi-objective 0-1 knapsack problem

In this paper, we propose a new procedure based 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. We show that t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied mathematics and computation Jg. 194; H. 2; S. 544 - 551
Hauptverfasser: Jolai, Fariborz, Rezaee, M.J., Rabbani, M., Razmi, J., Fattahi, Pariviz
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY Elsevier Inc 15.12.2007
Elsevier
Schlagworte:
Bi-objective 0-1 knapsack problem
Exact sciences and technology
Linear programming
Mathematical analysis
Mathematics
Multiple objective mathematical programming
Numerical analysis
Numerical analysis. Scientific computation
Numerical methods in mathematical programming, optimization and calculus of variations
Sciences and techniques of general use
Linear programming
Multiple objective mathematical programming
Bi-objective 0-1 knapsack problem
Numerical analysis
Applied mathematics
Optimization method
Algorithm
Mathematical programming
ISSN:0096-3003, 1873-5649
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we propose a new procedure based 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. We show that the proposed method is able to generate efficient solutions with less constraints and variables than the general linear program found in the literature. An example is presented to illustrate the steps of the procedure.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2007.04.062