A randomized heuristic repair for the multidimensional knapsack problem

DOI10.1007/s11590-020-01611-1zbMath1466.90090OpenAlexW3038206528MaRDI QIDQ828650

Bruno C. Ribas, Jean P. Martins

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

zbMATH Keywords

knapsack problemevolutionary algorithmsfeasibility repair

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• There is no EPTAS for two-dimensional knapsack
• A genetic algorithm for the multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• 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
• A new ant colony optimization algorithm for the multidimensional Knapsack problem
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
• The Multidimensional Knapsack Problem: Structure and Algorithms

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