Dynamic programming algorithms for the bi-objective integer knapsack problem

•A property of the traditional dynamic programming algorithm is identified.•The first algorithm is developed by directly using the property.•The second algorithm is developed by using the property in conjunction with the bound sets.•Insufficiency of linear relaxation solutions to estimate an upper b...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research Ročník 236; číslo 1; s. 85 - 99
Hlavní autori:	Rong, Aiying, Figueira, José Rui
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.07.2014 Elsevier Sequoia S.A
Predmet:	Algorithms Bound sets Dynamic programming Integer knapsack problems Integer programming Integers Knapsack problem Mathematical models Multi-objective optimization Numerical analysis Pareto optimality Pareto optimum Studies Tightening Upper bounds Multi-objective optimization Dynamic programming Integer knapsack problems Bound sets
ISSN:	0377-2217, 1872-6860
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!