A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation

DOI10.1023/B:JMMA.0000038617.09620.02zbMath1057.90045OpenAlexW1998409280MaRDI QIDQ702759

Carlos Gomes da Silva, Joao Carlos Namorado Climaco, José Rui Figueira

Publication date: 17 January 2005

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jmma.0000038617.09620.02

zbMATH Keywords

combinatorial optimization surrogate relaxation multidimensional knapsack problem Meta-heuristics scatter search method

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (11)

Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions ⋮ Scatter search for the 0-1 multidimensional knapsack problem ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems ⋮ Greedy algorithms for a class of knapsack problems with binary weights ⋮ Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms ⋮ Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

This page was built for publication: A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation