Hard multidimensional multiple choice knapsack problems, an empirical study

DOI10.1016/J.COR.2009.04.006MaRDI QIDQ733540zbMATH OpenOpenAlexFDO

Authors Bing Han, Jimmy Leblet, Gwendal Simon

Publication date 16 October 2009

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2009.04.006

zbMATH Keywords

algorithmperformance evaluationknapsack problemmultidimensionalmultiple choice

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
• scientific article; zbMATH DE number 1728442
• The multidimensional knapsack problem: structure and algorithms
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
• A branch-and-bound algorithm for hard multiple knapsack problems
• Some new results on multi-dimension Knapsack problem
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
• New greedy heuristics for the multiple-choice multi-dimensional knapsack problem

Cites work

• scientific article; zbMATH DE number 1281676 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
• A column generation method for the multiple-choice multi-dimensional knapsack problem
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• Core problems in knapsack algorithms
• Exploiting orbits in symmetric ILP
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• MVRC Heuristic for Solving the Multi-Choice Multi-Constraint Knapsack Problem
• Orbitopal Fixing
• Packing and partitioning orbitopes
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
• The knapsack problem: A survey
• Where are the hard knapsack problems?

Cited in

(16)

• SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
• scientific article; zbMATH DE number 1617338 (Why is no real title available?)
• scientific article; zbMATH DE number 1281676 (Why is no real title available?)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
• The multiple multidimensional knapsack with family-split penalties
• A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm
• A trust region method for the solution of the surrogate dual in integer programming
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
• Piece selection algorithms for layered video streaming in P2P networks
• A decomposition approach for multidimensional knapsacks with family‐split penalties
• Solving constrained optimization problems by solution-based decomposition search
• scientific article; zbMATH DE number 5282967 (Why is no real title available?)
• Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
• A decentralized heuristic for multiple-choice combinatorial optimization problems
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem

Describes a project that uses

Uses Software

• CPLEX
• GLPK
• Knapsack

This page was built for publication: Hard multidimensional multiple choice knapsack problems, an empirical study

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