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

DOI10.1023/B:JMMA.0000038617.09620.02MaRDI QIDQ702759zbMATH OpenOpenAlexFDO

Authors 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 optimizationMeta-heuristicsmultidimensional knapsack problemscatter search methodsurrogate relaxation

Mathematics Subject Classification ID

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

Recommendations

• A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
• Scatter search for the 0-1 multidimensional knapsack problem
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
• scientific article; zbMATH DE number 5282967
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem

Cited in

(14)

• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
• Greedy algorithms for a class of knapsack problems with binary weights
• Zero duality gap in surrogate constraint optimization: a concise review of models
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
• Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
• A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• Dynamic programming algorithms for the bi-objective integer knapsack problem
• Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
• scientific article; zbMATH DE number 5282967 (Why is no real title available?)
• Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
• Scatter search for the 0-1 multidimensional 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702759)