Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419): Difference between revisions

@@ Property / describes a project that uses @@
+ADBASE
@@ Property / describes a project that uses: ADBASE / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2043322538
@@ Property / OpenAlex ID: W2043322538 / rank @@
+Normal rank
@@ Property / cites work @@
+The multidimensional 0-1 knapsack problem: an overview.
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+The core concept for the Multidimensional Knapsack problem
+Normal rank
@@ Property / cites work @@
+An Algorithm for Large Zero-One Knapsack Problems
@@ Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for the 0-1 Knapsack Problem
@@ Property / cites work: A New Algorithm for the 0-1 Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+A minimal algorithm for the multiple-choice knapsack problem
+Normal rank
@@ Property / cites work @@
+Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for mixed zero-one multiple objective linear programming
+Normal rank
@@ Property / cites work @@
+Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
+Normal rank
@@ Property / cites work @@
+A method for generating all efficient solutions of 0-1 multi-objective linear programming problem
+Normal rank
@@ Property / cites work @@
+Exact algorithm for bi-objective 0-1 knapsack problem
+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 @@
+Q4001824
@@ Property / cites work: Q4001824 / rank @@
+Normal rank
@@ Property / cites work @@
+A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for the multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1044419