A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

•Introduce size reduction and upper bound reduction based on the core concept.•Construct the mixed network consisting of items with different upper bounds.•Develop an efficient dynamic programming algorithm based on the mixed network.•Conduct the time complexity analysis for the reduction procedures...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 231; H. 2; S. 299 - 313
Hauptverfasser:	Rong, Aiying, Figueira, José Rui
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.12.2013 Elsevier Sequoia S.A
Schlagworte:	Algorithms Approximation Core concept Dominance relation Dynamic programming Effectiveness studies Integer knapsack problem Integer programming Integers Knapsack problem Mathematical functions Mathematical models Multi-objective programming Networks Pareto optimum State reduction Upper bounds Dominance relation Multi-objective programming Dynamic programming State reduction Integer knapsack problem Core concept
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!