A best first search exact algorithm for the multiple-choice multidimensional knapsack problem

DOI10.1007/S10878-006-9035-3MaRDI QIDQ2467571zbMATH OpenOpenAlexFDO

Authors Abdelkader Sbihi

Publication date 22 January 2008

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-006-9035-3

zbMATH Keywords

sequential algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
• A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
• Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
• An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core

Cites work

• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A Minimal Algorithm for the 0-1 Knapsack Problem
• A New Algorithm for the 0-1 Knapsack Problem
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• A genetic algorithm for the multidimensional knapsack problem
• A min-max resource allocation problem with substitutions
• A minimal algorithm for the multiple-choice knapsack problem
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• An Algorithm for Large Zero-One Knapsack Problems
• An approximation algorithm for the generalized assignment problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• Minimax resource allocation problems: Optimization and parametric analysis
• The 0-1 knapsack problem with multiple choice constraints
• The Multiple-Choice Knapsack Problem

Cited in

(25)

• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core
• Algorithmic Applications in Management
• CORAL: an exact algorithm for the multidimensional knapsack problem
• 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
• A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
• Vector bin packing with multiple-choice
• An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
• An improved binary search algorithm for the multiple-choice knapsack problem
• A cooperative local search-based algorithm for the multiple-scenario max-min 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
• Remarks on 0-1 optimization problems with superincreasing and superdecreasing objective functions
• scientific article; zbMATH DE number 6129400 (Why is no real title available?)
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• Hard multidimensional multiple choice knapsack problems, an empirical study
• A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
• Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
• Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
• An approximate binary search algorithm for the multiple-choice knapsack problem
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
• scientific article; zbMATH DE number 5733644 (Why is no real title available?)
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: A best first search exact algorithm 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 Q2467571)