scientific article; zbMATH DE number 6129400

zbMATH Open1265.90218MaRDI QIDQ4900928FDOQ4900928

Authors: Geng Lin, Wenxing Zhu 

Publication date: 24 January 2013

Title of this publication is not available (Why is that?)

Recommendations

• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
• Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
• Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem
• A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
• A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
• An approximate dynamic programming approach to multidimensional knapsack problems
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• Variable neighbourhood search for the variable sized bin packing problem
• An efficient algorithm for multi-dimensional nonlinear knapsack problems
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem

zbMATH Keywords

variable neighborhood searchmultidimensional knapsack problemfilled function

Mathematics Subject Classification ID

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

This page was built for publication:

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