A column generation method for the multiple-choice multi-dimensional knapsack problem

DOI10.1007/S10589-008-9184-7MaRDI QIDQ969718zbMATH OpenOpenAlexFDO

Authors Mhand Hifi, Nawal Cherfi

Publication date 7 May 2010

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-008-9184-7

zbMATH Keywords

optimizationheuristicscolumn generationbranch-and-boundknapsack

Mathematics Subject Classification ID

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

Recommendations

• Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Column Generation Approach for Graph Coloring
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Linear Programming Approach to the Cutting-Stock Problem
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• An Algorithm for Large Zero-One Knapsack Problems
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem

Cited in

(16)

• A column-generation approach to the multiple knapsack problem with color constraints
• A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
• Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
• An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
• A heuristic algorithm for resource allocation/reallocation problem
• Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
• Hard multidimensional multiple choice knapsack problems, an empirical study
• A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
• Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
• Large-Scale Scientific Computing
• Column basis reduction and decomposable knapsack problems
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem
• An Improved Knapsack Solver for Column Generation

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A column generation method 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 Q969718)