A randomized heuristic repair for the multidimensional knapsack problem

DOI10.1007/S11590-020-01611-1zbMATH Open1466.90090OpenAlexW3038206528MaRDI QIDQ828650FDOQ828650

Authors: J. Martins, Bruno C. Ribas 

Publication date: 5 May 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01611-1

Recommendations

• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
• Heuristics for the 0-1 multidimensional knapsack problem
• The multidimensional knapsack problem: structure and algorithms
• scientific article; zbMATH DE number 1054949

zbMATH Keywords

knapsack problemevolutionary algorithmsfeasibility repair

Mathematics Subject Classification ID

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

Cites Work

• The multidimensional knapsack problem: structure and algorithms
• A genetic algorithm for the multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• A new ant colony optimization algorithm for the multidimensional Knapsack problem
• There is no EPTAS for two-dimensional knapsack
• Title not available (Why is that?)
• Title not available (Why is that?)
• Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
• CORAL: an exact algorithm for the multidimensional knapsack problem

Cited In (2)

• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Generalization of the subset sum problem and cubic forms

This page was built for publication: A randomized heuristic repair for the multidimensional knapsack problem

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