Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems
DOI10.1016/J.CAMWA.2012.03.057zbMATH Open1247.90241OpenAlexW2092539929MaRDI QIDQ453890FDOQ453890
Authors: Aiying Rong, José Rui Figueira 
Publication date: 30 September 2012
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2012.03.057
Recommendations
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
- A reduction dynamic programming algorithm for the bi-objective integer 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
- Solving efficiently the 0-1 multi-objective knapsack problem
dynamic programmingmulti-objective optimizationbasic state reduction techniquesbi-objective knapsack problem
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Dynamic programming (90C39) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria Optimization
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Title not available (Why is that?)
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Labeling algorithms for multiple objective integer knapsack problems
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
- Solving efficiently the 0-1 multi-objective knapsack problem
- Exact algorithm for bi-objective 0-1 knapsack problem
- Unbounded knapsack problem: Dynamic programming revisited
- Finding non-dominated solutions in bi-objective integer network flow problems
- Title not available (Why is that?)
Cited In (4)
- Route-reduction-based dynamic programming for large-scale satellite range scheduling problem
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
This page was built for publication: Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453890)
