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

@@ Property / cites work @@
+Bicriteria Transportation Problem
@@ Property / cites work: Bicriteria Transportation Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
+Normal rank
@@ Property / cites work @@
+Solving efficiently the 0-1 multi-objective knapsack problem
+Normal rank
@@ Property / cites work @@
+Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Multiobjective Knapsack Problems
@@ Property / cites work: Approximating Multiobjective Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
+Normal rank
@@ Property / cites work @@
+Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
+Normal rank
@@ Property / cites work @@
+Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
+Normal rank
@@ Property / cites work @@
+A bicriteria knapsack program for planning remediation of contaminated lightstation sites
+Normal rank
@@ Property / cites work @@
+Q4945108
@@ Property / cites work: Q4945108 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Relocation problems arising in conservation biology
+Normal rank
@@ Property / cites work @@
+Bound sets for biobjective combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete Dynamic Programming and Capital Allocation
+Normal rank
@@ Property / cites work @@
+A Minimal Algorithm for the 0-1 Knapsack Problem
@@ Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
+Normal rank
@@ Property / cites work @@
+Q3815146
@@ Property / cites work: Q3815146 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
+Normal rank