An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759): Difference between revisions

Latest revision as of 20:28, 18 July 2024

scientific article

Language	Label	Description	Also known as
English	An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics	scientific article

Statements

instance of

scholarly article

0 references

title

An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (English)

0 references

zbMATH Open document ID

1410.90273

0 references

DOI

10.1016/j.amc.2015.08.018

0 references

0 references

0 references

0 references

Applied Mathematics and Computation

0 references

publication date

20 March 2019

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

combinatorial optimization

0 references

branch-and-bound

0 references

evolutionary computations

0 references

metaheuristics

0 references

multi-objective programming

0 references

multi-dimensional knapsack problems

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.amc.2015.08.018

0 references

0 references

0 references

0 references

The three-dimensional knapsack problem with balancing constraints

0 references

Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core

0 references

A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

0 references

Multicriteria 0-1 knapsack problems with \(k\)-min objectives

0 references

Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem

0 references

Q3815146

0 references

Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms

0 references

The multiobjective multidimensional knapsack problem: a survey and a new approach

0 references

Multicriteria Optimization

0 references

An Algorithm for Large Zero-One Knapsack Problems

0 references

New trends in exact algorithms for the \(0-1\) knapsack problem

0 references

An expanding-core algorithm for the exact \(0-1\) knapsack problem

0 references

Core Problems in Knapsack Algorithms

0 references

Discrete-Variable Extremum Problems

0 references

Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems

0 references

The core concept for the Multidimensional Knapsack problem

0 references

The Multidimensional Knapsack Problem: Structure and Algorithms

0 references

Q4424311

0 references

Core problems in bi-criteria \(\{0,1\}\)-knapsack problems

0 references

A branch and bound algorithm for mixed zero-one multiple objective linear programming

0 references

Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming

0 references

Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems

0 references

An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems

0 references

An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method

0 references

Q4424322

0 references

Multi-directional local search

0 references

MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:670759

@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+The three-dimensional knapsack problem with balancing constraints
+Normal rank
@@ Property / cites work @@
+Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
+Normal rank
@@ Property / cites work @@
+A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
+Normal rank
@@ Property / cites work @@
+Multicriteria 0-1 knapsack problems with \(k\)-min objectives
+Normal rank
@@ Property / cites work @@
+Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
+Normal rank
@@ Property / cites work @@
+Q3815146
@@ Property / cites work: Q3815146 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
+Normal rank
@@ Property / cites work @@
+The multiobjective multidimensional knapsack problem: a survey and a new approach
+Normal rank
@@ Property / cites work @@
+Multicriteria Optimization
@@ Property / cites work: Multicriteria Optimization / rank @@
+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 @@
+New trends in exact algorithms for the \(0-1\) knapsack problem
+Normal rank
@@ Property / cites work @@
+An expanding-core algorithm for the exact \(0-1\) knapsack problem
+Normal rank
@@ Property / cites work @@
+Core Problems in Knapsack Algorithms
@@ Property / cites work: Core Problems in Knapsack Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete-Variable Extremum Problems
@@ Property / cites work: Discrete-Variable Extremum Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
+Normal rank
@@ Property / cites work @@
+The core concept for the Multidimensional Knapsack problem
+Normal rank
@@ Property / cites work @@
+The Multidimensional Knapsack Problem: Structure and Algorithms
+Normal rank
@@ Property / cites work @@
+Q4424311
@@ Property / cites work: Q4424311 / rank @@
+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 @@
+Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
+Normal rank
@@ Property / cites work @@
+An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
+Normal rank
@@ Property / cites work @@
+An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
+Normal rank
@@ Property / cites work @@
+Q4424322
@@ Property / cites work: Q4424322 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-directional local search
@@ Property / cites work: Multi-directional local search / rank @@
+Normal rank
@@ Property / cites work @@
+MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
+Normal rank