Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem

DOI10.1504/IJOR.2009.024531zbMATH Open1169.90484OpenAlexW3023784225MaRDI QIDQ840573FDOQ840573

Authors: Nawal Cherfi, Mhand Hifi 

Publication date: 13 September 2009

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2009.024531

Recommendations

• A column generation method for the multiple-choice multi-dimensional knapsack problem
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
• scientific article; zbMATH DE number 5733644
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem

zbMATH Keywords

heuristicsoptimisationknapsack problemcolumn generationbranch-and-boundhybrid algorithmslocal branchingmultiple choice

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Cited In (21)

• Title not available (Why is that?)
• A heuristic algorithm for resource allocation/reallocation problem
• A hybrid distribution estimation algorithm for solving multidimensional knapsack problems
• A column generation method for the multiple-choice multi-dimensional knapsack problem
• Hybrid rounding techniques for knapsack problems
• A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
• Hybrid approaches for the two-scenario max-min knapsack problem
• Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: which one works better when?
• A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
• Title not available (Why is that?)
• An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
• Hard multidimensional multiple choice knapsack problems, an empirical study
• 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
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
• Title not available (Why is that?)
• 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
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem

Uses Software

• Knapsack

This page was built for publication: Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem

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