A hybrid dynamic programming approach to the biobjective binary knapsack problem

Charles Delort 1 Olivier Spanjaard 1
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This article is devoted to a study of the impact of using bound sets in biobjective dynamic programming. This notion, introduced by Villareal and Karwan [1981], has been independently revisited by Ehrgott and Gandibleux [2007], as well as by Sourd and Spanjaard [2008]. The idea behind it is very general and can, therefore, be adapted to a wide range of biobjective combinatorial problems. We focus here on the biobjective binary knapsack problem. We show that using bound sets to perform a hybrid dynamic programming procedure embedded in a two-phase method [Ulungu and Teghem 1995] yields numerical results that outperform previous dynamic programming approaches to the problem, both in execution times and memory requirements.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [24 references]  Display  Hide  Download

Contributor : Lip6 Publications <>
Submitted on : Wednesday, July 12, 2017 - 12:00:05 PM
Last modification on : Friday, March 22, 2019 - 1:41:24 AM
Document(s) archivé(s) le : Thursday, January 25, 2018 - 2:34:53 AM


Files produced by the author(s)



Charles Delort, Olivier Spanjaard. A hybrid dynamic programming approach to the biobjective binary knapsack problem. ACM Journal of Experimental Algorithmics, Association for Computing Machinery, 2013, 18, pp.1.2. ⟨10.1145/2444016.2444018⟩. ⟨hal-01170490⟩



Record views


Files downloads