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

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 236; no. 1; pp. 85 - 99
Main Authors:	Rong, Aiying, Figueira, José Rui
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.07.2014 Elsevier Sequoia S.A
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!