Heuristic algorithms for the multiple-choice multidimensional knapsack problem

DOI10.1057/PALGRAVE.JORS.2601796MaRDI QIDQ4678202zbMATH OpenOpenAlexFDO

Authors Mhand Hifi, M. Michrafy, Abdelkader Sbihi

Publication date 23 May 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601796

zbMATH Keywords

combinatorial optimizationguided local searchheuristic, knapsack

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1728442
• New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
• Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem

Cited in

(29)

• Cooperative strategies for solving the bicriteria sparse multiple knapsack problem
• Placement optimization in refugee resettlement
• A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
• A heuristic algorithm for resource allocation/reallocation problem
• Vector bin packing with multiple-choice
• A column generation method for the multiple-choice multi-dimensional knapsack problem
• scientific article; zbMATH DE number 1728442 (Why is no real title available?)
• A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
• New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
• The multiple multidimensional knapsack with family-split penalties
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem
• Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
• A decomposition approach for multidimensional knapsacks with family‐split penalties
• A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
• An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
• Modeling multiple plant sourcing decisions
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• Hard multidimensional multiple choice knapsack problems, an empirical study
• Maximizing revenue with allocation of multiple advertisements on a Web banner
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• A complementary greedy heuristic for the knapsack problem
• Heuristics for the general multiple non-linear knapsack problem
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
• Heuristic algorithms for the general nonlinear separable knapsack problem
• Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
• MVRC Heuristic for Solving the Multi-Choice Multi-Constraint Knapsack Problem

Describes a project that uses

Uses Software

• MULKNAP

This page was built for publication: Heuristic algorithms for the multiple-choice multidimensional knapsack problem

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