First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem
From MaRDI portal
Publication:2256919
DOI10.1504/IJMHEUR.2013.054150zbMath1306.90129OpenAlexW2050740038MaRDI QIDQ2256919
Chaitr S. Hiremath, Raymond R. Hill
Publication date: 23 February 2015
Published in: International Journal of Metaheuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijmheur.2013.054150
metaheuristicsoptimisationmultidimensional knapsack problemempirical analysismultiple-choice tabu search
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem ⋮ A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX® ⋮ Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners ⋮ A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
This page was built for publication: First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem