Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890): Difference between revisions

Latest revision as of 18:18, 5 July 2024

scientific article

Language	Label	Description	Also known as
English	Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems	scientific article

Statements

instance of

scholarly article

0 references

title

Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (English)

0 references

0 references

0 references

Computers \& Mathematics with Applications

0 references

publication date

30 September 2012

0 references

zbMATH Keywords

multi-objective optimization

0 references

bi-objective knapsack problem

0 references

dynamic programming

0 references

basic state reduction techniques

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.camwa.2012.03.057

0 references

cites work

Q4821303

0 references

Multicriteria Optimization

0 references

Implementing an efficient fptas for the 0-1 multi-objective knapsack problem

0 references

Q4495184

0 references

Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case

0 references

An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization

0 references

A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems

0 references

Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem

0 references

Solving bicriteria 0--1 knapsack problems using a labeling algorithm.

0 references

Solving efficiently the 0-1 multi-objective knapsack problem

0 references

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

0 references

Exact algorithm for bi-objective 0-1 knapsack problem

0 references

Labeling algorithms for multiple objective integer knapsack problems

0 references

Q3885184

0 references

Unbounded knapsack problem: Dynamic programming revisited

0 references

Q3802899

0 references

Q3241581

0 references

Q4945108

0 references

Finding non-dominated solutions in bi-objective integer network flow problems

0 references

Identifiers

zbMATH Open document ID

1247.90241

0 references

DOI

10.1016/j.camwa.2012.03.057

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:453890

@@ Property / author @@
-José Rui Figueira
@@ Property / author: José Rui Figueira / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.camwa.2012.03.057
+Normal rank
@@ Property / OpenAlex ID @@
+W2092539929
@@ Property / OpenAlex ID: W2092539929 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicriteria Optimization
@@ Property / cites work: Multicriteria Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4495184
@@ Property / cites work: Q4495184 / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
+Normal rank
@@ Property / cites work @@
+An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
+Normal rank
@@ Property / cites work @@
+Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
+Normal rank
@@ Property / cites work @@
+Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
+Normal rank
@@ Property / cites work @@
+Solving efficiently the 0-1 multi-objective knapsack problem
+Normal rank
@@ Property / cites work @@
+A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
+Normal rank
@@ Property / cites work @@
+Exact algorithm for bi-objective 0-1 knapsack problem
+Normal rank
@@ Property / cites work @@
+Labeling algorithms for multiple objective integer knapsack problems
+Normal rank
@@ Property / cites work @@
+Q3885184
@@ Property / cites work: Q3885184 / rank @@
+Normal rank
@@ Property / cites work @@
+Unbounded knapsack problem: Dynamic programming revisited
+Normal rank
@@ Property / cites work @@
+Q3802899
@@ Property / cites work: Q3802899 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3241581
@@ Property / cites work: Q3241581 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945108
@@ Property / cites work: Q4945108 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding non-dominated solutions in bi-objective integer network flow problems
+Normal rank