A survey of effective heuristics and their application to a variety of knapsack problems
From MaRDI portal
Publication:3524431
DOI10.1093/imaman/dpn004zbMath1163.90721OpenAlexW2067509362MaRDI QIDQ3524431
Christophe Wilbaut, Saïd Hanafi
Publication date: 9 September 2008
Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/30b4b7503a7004646ba4a75b6f0aaf4f626f0854
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Large-scale multi-period precedence constrained knapsack problem: A mining application ⋮ Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Robust efficiency measures for linear knapsack problem variants ⋮ Hybrid approaches for the two-scenario max-min knapsack problem ⋮ Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities ⋮ Optimal selection of touristic packages based on user preferences during sports mega-events ⋮ Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem ⋮ A metaheuristic for security budget allocation in utility networks ⋮ Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem ⋮ An application of the multiple knapsack problem: the self-sufficient marine ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ Solving 0-1 knapsack problems based on amoeboid organism algorithm ⋮ A binary differential search algorithm for the 0-1 multidimensional knapsack problem ⋮ Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints ⋮ Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem ⋮ An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem ⋮ Memory and Learning in Metaheuristics ⋮ A decomposition method for large scale MILPs, with performance guarantees and a power system application
Uses Software
This page was built for publication: A survey of effective heuristics and their application to a variety of knapsack problems
