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.90092MaRDI QIDQ3750525

Hasan Pirkul

Publication date: 1987

zbMATH Keywords

heuristic procedure; surrogate duality; multiconstraint knapsack problems

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C27: Combinatorial optimization

90C09: Boolean programming

Related Items

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 -- bounds and computational aspects, A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles, Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem, An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, A surrogate heuristic for set covering problems, The multidimensional 0-1 knapsack problem: an overview., 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, 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 new ant colony optimization algorithm for the multidimensional Knapsack problem, Greedy algorithm for the general multidimensional knapsack problem, Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence