Characterizing locality in decoder-based EAs for the multidimensional knapsack problem

DOI10.1007/10721187_3MaRDI QIDQ2722077zbMATH OpenFDO

Authors Jens Gottlieb, Günther R. Raidl

Publication date 11 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10721187_3

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• Probabilistic and deterministic local search for solving the binary multiknapsack problem
• A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• scientific article; zbMATH DE number 1524330
• Local neighborhoods for the multidimensional assignment problem
• A Note on Approximation Schemes for Multidimensional Knapsack Problems
• An efficient algorithm for multi-dimensional nonlinear knapsack problems
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• Hard multidimensional multiple choice knapsack problems, an empirical study

Cited in

(1)

• Designing Efficient Evolutionary Algorithms for Cluster Optimization: A Study on Locality

This page was built for publication: Characterizing locality in decoder-based EAs for the multidimensional knapsack problem

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