A heuristic solution procedure for the multiconstraint zero-one knapsack problem
From MaRDI portal
Publication:3750525
DOI<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
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
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, A surrogate heuristic for set covering problems, Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm, A RNN-based hyper-heuristic for combinatorial problems, Matheuristics: survey and synthesis, Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application, Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm, A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators, Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems, The multidimensional 0-1 knapsack problem: an overview., Essential particle swarm optimization queen with tabu search for MKP resolution, A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles, A new ant colony optimization algorithm for the multidimensional Knapsack problem, Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem, Greedy algorithm for the general multidimensional knapsack problem, Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method, Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem, Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence, Revisiting surrogate relaxation for the multidimensional knapsack problem, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
