Tabu search: global intensification using dynamic programming

zbMATH Open1121.49027MaRDI QIDQ3437243FDOQ3437243

Authors: Christophe Wilbaut, Saïd Hanafi, Arnaud Fréville, Stefan Balev 

Publication date: 14 May 2007

Full work available at URL: https://eudml.org/doc/209436

Recommendations

• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Tabu Search—Part I
• Tabu Search—Part II
• scientific article; zbMATH DE number 1054947
• scientific article; zbMATH DE number 2209656

zbMATH Keywords

multidimensional \(0-1\) knapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming in optimal control and differential games (49L20)

Cited In (7)

• A common Tabu search algorithm for the global optimization of engineering problems
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• Title not available (Why is that?)
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
• New convergent heuristics for 0-1 mixed integer programming
• Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem

Uses Software

• CPLEX

This page was built for publication: Tabu search: global intensification using dynamic programming

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