Algorithmic improvements on dynamic programming for the bi-objective \0,1\ knapsack problem
DOI10.1007/S10589-013-9551-XzbMATH Open1276.90057OpenAlexW2020127609MaRDI QIDQ360382FDOQ360382
Authors: Luís Paquete, Marco Simões, Daniel Vanderpooten, José Rui Figueira 
Publication date: 26 August 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9551-x
Recommendations
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- A hybrid dynamic programming approach to the biobjective binary knapsack problem
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
multi-objective combinatorial optimizationbi-objective \{0,1\} knapsack problemsbi-objective simplex algorithmbounds setsdichotomic search
Cites Work
- Title not available (Why is that?)
- Introduction to algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- A bicriteria knapsack program for planning remediation of contaminated lightstation sites
- Relocation problems arising in conservation biology
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- Bicriteria Transportation Problem
- Title not available (Why is that?)
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Bound sets for biobjective combinatorial optimization problems
- Solving efficiently the 0-1 multi-objective knapsack problem
- Approximating multiobjective knapsack problems
- Discrete dynamic programming and capital allocation
Cited In (16)
- A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem
- Bridging game theory and the knapsack problem: a theoretical formulation
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Bi-dimensional knapsack problems with one soft constraint
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- Solution approaches for equitable multiobjective integer programming problems
- Ordinal optimization through multi-objective reformulation
- Finding multi-objective supported efficient spanning trees
- Network Models for Multiobjective Discrete Optimization
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Computing representations using hypervolume scalarizations
- Parallel implementation of an exact two-phase method for the biobjective knapsack problem
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Uses Software
This page was built for publication: Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360382)
