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

DOI10.1002/1520-6750(198704)34:2%3C161::AID-NAV3220340203%3E3.0.CO;2-AMaRDI QIDQ3750525zbMATH OpenOpenAlexFDO

Authors Hasan Pirkul

Publication date 1987

Full work available at URL https://doi.org/10.1002/1520-6750(198704)34:2%3C161::aid-nav3220340203%3E3.0.co;2-a

zbMATH Keywords

heuristic proceduremulticonstraint knapsack problemssurrogate duality

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09) Combinatorial optimization (90C27)

Recommendations

• A heuristic algorithm for the multidimensional zero-one knapsack problem
• A procedure-based heuristic for 0-1 multiple knapsack problems
• Heuristics for the 0-1 multidimensional knapsack problem
• An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• scientific article; zbMATH DE number 1728442
• Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem
• Problem reduction heuristic for the 0-1 multidimensional knapsack problem
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• scientific article; zbMATH DE number 33203

Cited in

(36)

• 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.
• Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems.
• A procedure-based heuristic for 0-1 multiple knapsack problems
• 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
• Smart greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
• A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
• Revisiting surrogate relaxation for the multidimensional knapsack problem
• A RNN-based hyper-heuristic for combinatorial problems
• 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
• scientific article; zbMATH DE number 1703849 (Why is no real title available?)
• Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence
• Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application
• Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures
• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
• 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
• AN APPROACH FOR WORST CASE ANALYSIS OF HEURISTICS : ANALYSIS OF A FLEXIBLE 0-1 KNAPSACK PROBLEM
• Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
• Essential particle swarm optimization queen with tabu search for MKP resolution
• An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• Matheuristics: survey and synthesis
• A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
• Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
• A solution procedure for general knapsack problems with a few constraints
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750525)