A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem

DOI10.1016/j.camwa.2011.07.067zbMath1232.90325OpenAlexW1985999411MaRDI QIDQ662206

Aiying Rong, Margarida Vaz Pato, José Rui Figueira

Publication date: 21 February 2012

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.07.067

zbMATH Keywords

multi-objective optimizationdynamic programmingstate reductionbi-objective knapsack instances

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving efficiently the 0-1 multi-objective knapsack problem
• Multiple criteria facility location problems: a survey
• Exact algorithm for bi-objective 0-1 knapsack problem
• Labeling algorithms for multiple objective integer knapsack problems
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Unbounded knapsack problem: Dynamic programming revisited
• Where are the hard knapsack problems?
• Relocation problems arising in conservation biology
• A multi-objective model for environmental investment decision making
• Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
• Multicriteria Optimization

This page was built for publication: A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem