The Multidimensional Knapsack Problem: Structure and Algorithms

From MaRDI portal
Publication:2899058

DOI10.1287/ijoc.1090.0344zbMath1243.90190OpenAlexW2168848281WikidataQ61638331 ScholiaQ61638331MaRDI QIDQ2899058

Ulrich Pferschy, Jakob Puchinger, Günther R. Raidl

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01224914/file/puchinger-07.pdf




Related Items (35)

Generalized average shadow prices and bottlenecksA randomized heuristic repair for the multidimensional knapsack problemA ``reduce and solve approach for the multiple-choice multidimensional knapsack problemAn Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret CriterionDecomposition based hybrid metaheuristicsSurrogate upper bound sets for bi-objective bi-dimensional binary knapsack problemsKnapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problemsRobust efficiency measures for linear knapsack problem variantsBi-dimensional knapsack problems with one soft constraintImproving problem reduction for 0-1 multidimensional knapsack problems with valid inequalitiesOn the complexity of separation from the knapsack polytopeA Modified Binary Particle Swarm Optimization for Knapsack ProblemsA variable neighborhood search algorithm for an integrated physician planning and scheduling problemSolving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithmPseudo-polynomial algorithms for solving the knapsack problem with dependencies between itemsA two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problemCanonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale SystemsA memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problemEssential particle swarm optimization queen with tabu search for MKP resolutionAn improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristicsApproximate and exact merging of knapsack constraints with cover inequalitiesInbound and outbound flow integration for cross-docking operationsTwo-stage solution-based tabu search for the multidemand multidimensional knapsack problemImproved core problem based heuristics for the 0/1 multi-dimensional knapsack problemImproved LP-based algorithms for the closest string problemIdentifying redundancy in multi-dimensional knapsack constraints based on surrogate constraintsComputational experience with a core-based reduction procedure for the 2-knapsack problemA binary differential search algorithm for the 0-1 multidimensional knapsack problemEmpirical orthogonal constraint generation for multidimensional 0/1 knapsack problemsDichotomous binary differential evolution for knapsack problemsThe basic train makeup problem in shunting yardsCORAL: An Exact Algorithm for the Multidimensional Knapsack ProblemIntegrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturerRevisiting surrogate relaxation for the multidimensional knapsack problemOn the exact separation of cover inequalities of maximum-depth


Uses Software



This page was built for publication: The Multidimensional Knapsack Problem: Structure and Algorithms