New reduction strategy in the biobjective knapsack problem

DOI10.1111/ITOR.12285MaRDI QIDQ4624895zbMATH OpenOpenAlexFDO

Authors Malika Daoud, D. Chaabane

Publication date 20 February 2019

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12285

zbMATH Keywords

efficient solutionknapsack problemmultiple objectiveregular variable

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Multi-objective and goal programming (90C29)

Recommendations

• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
• Exact algorithm for bi-objective 0-1 knapsack problem
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• A two state reduction based dynamic programming algorithm for the bi-objective 0-1 knapsack problem
• scientific article; zbMATH DE number 1784663

Cited in

(2)

• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Parallel implementation of an exact two-phase method for the biobjective knapsack problem

This page was built for publication: New reduction strategy in the biobjective knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4624895)