A hybrid dynamic programming approach to the biobjective binary knapsack problem
From MaRDI portal
Recommendations
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- A reduction dynamic programming algorithm for the bi-objective integer 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
Cited in
(13)- A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Algorithmic improvements on dynamic programming for the 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
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Bound sets for biobjective combinatorial optimization problems
- Bi-dimensional knapsack problems with one soft constraint
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- A hybrid approach for biobjective optimization
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- Dynamic programming for a biobjective search problem in a line
This page was built for publication: A hybrid dynamic programming approach to the biobjective binary knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178734)
