A heuristic solution procedure for the multiconstraint zero-one knapsack problem

From MaRDI portal
Revision as of 11:13, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3750525

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A" /><161::AID-NAV3220340203>3.0.CO;2-A 10.1002/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-AzbMath0609.90092OpenAlexW2171682893MaRDI QIDQ3750525

Hasan Pirkul

Publication date: 1987

Full work available at URL: https://doi.org/10.1002/1520-6750(198704)34:2<161::aid-nav3220340203>3.0.co;2-a




Related Items (22)

An efficient preprocessing procedure for the multidimensional 0-1 knapsack problemA surrogate heuristic for set covering problemsSolving large-scale multidimensional knapsack problems with a new binary harmony search algorithmA RNN-based hyper-heuristic for combinatorial problemsMatheuristics: survey and synthesisLogic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network applicationSolving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithmA new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operatorsLagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problemA theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problemA fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problemsThe multidimensional 0-1 knapsack problem: an overview.Essential particle swarm optimization queen with tabu search for MKP resolutionA new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principlesA new ant colony optimization algorithm for the multidimensional Knapsack problemFast, effective heuristics for the 0-1 multi-dimensional knapsack problemGreedy algorithm for the general multidimensional knapsack problemSolving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection methodProblem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problemBinary trie coding scheme: an intelligent genetic algorithm avoiding premature convergenceRevisiting surrogate relaxation for the multidimensional knapsack problemThe multidimensional 0-1 knapsack problem -- bounds and computational aspects






This page was built for publication: A heuristic solution procedure for the multiconstraint zero-one knapsack problem