Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382): Difference between revisions

@@ Property / author @@
+José Rui Figueira
@@ Property / author: José Rui Figueira / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C39
@@ Property / Mathematics Subject Classification ID: 90C39 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6201601
@@ Property / zbMATH DE Number: 6201601 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bi-objective \{0,1\} knapsack problems
@@ Property / zbMATH Keywords: bi-objective \{0,1\} knapsack problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+multi-objective combinatorial optimization
@@ Property / zbMATH Keywords: multi-objective combinatorial optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bounds sets
@@ Property / zbMATH Keywords: bounds sets / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dichotomic search
@@ Property / zbMATH Keywords: dichotomic search / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bi-objective simplex algorithm
@@ Property / zbMATH Keywords: bi-objective simplex algorithm / rank @@
+Normal rank

Revision as of 11:28, 28 June 2023