Tabu search: global intensification using dynamic programming

MaRDI QIDQ3437243zbMATH OpenFDO

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

zbMATH Keywords

multidimensional \(0-1\) knapsack problem

Mathematics Subject Classification ID

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

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

Cited in

(7)

• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
• Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem
• New convergent heuristics for 0-1 mixed integer programming
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
• scientific article; zbMATH DE number 5282985 (Why is no real title available?)
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• A common Tabu search algorithm for the global optimization of engineering problems

Describes a project that uses

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)