Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958): Difference between revisions

@@ 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 @@
+Pareto optimality, game theory and equilibria
@@ Property / cites work: Pareto optimality, game theory and equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of recent developments in multiobjective optimization
+Normal rank
@@ Property / cites work @@
+Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
+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 @@
+The identification of nondominated and efficient paths on a network
+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