Scatter search for the 0-1 multidimensional knapsack problem
From MaRDI portal
Publication:928688
DOI10.1007/s10852-008-9078-9zbMath1140.68063OpenAlexW2024418868MaRDI QIDQ928688
Christophe Wilbaut, Saïd Hanafi
Publication date: 11 June 2008
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-008-9078-9
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators, Scatter search with stochastic beam search on the coalition formation problem, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP), A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A genetic algorithm for the multidimensional knapsack problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- An experimental evaluation of a scatter search for the linear ordering problem
- Scatter search and star-paths: Beyond the genetic metaphor
- An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
- Tabu Search—Part I
- Tabu Search—Part II
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- Scatter Search and Path Relinking: Advances and Applications
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- The Theory and Computation of Knapsack Functions
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite