Greedy algorithm for the general multidimensional knapsack problem

DOI10.1007/S10479-006-0150-4MaRDI QIDQ2480198zbMATHOpenAlexFDO

Authors Yalçın Akçay, Haijun Li, Susan H. Xu

Publication date 31 March 2008

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-006-0150-4

zbMATH Keywords

heuristicsinteger programmingmultidimensional knapsack problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• A class of generalized greedy algorithms for the multi-knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• Heuristics for the 0-1 multidimensional knapsack problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• A genetic algorithm for the multidimensional knapsack problem
• A heuristic algorithm for the multidimensional zero-one knapsack problem
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
• Approximation algorithms for knapsack problems with cardinality constraints
• Combinatorial auctions: a survey
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• Optimal project selection: Stochastic knapsack with finite time horizon
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• The multidimensional 0-1 knapsack problem: an overview.

Cited in

(16)

• A Stackelberg knapsack game with weight control
• Statistical mechanics analysis of generalized multi-dimensional knapsack problems
• Optimal targeted mass screening in non‐uniform populations with multiple tests and schemes
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
• Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
• A RNN-based hyper-heuristic for combinatorial problems
• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
• Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence
• A total-value greedy heuristic for the integer knapsack problem
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• Optimal allocation of stock levels and stochastic customer demands to a capacitated resource
• Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
• A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
• New greedy heuristics for the multiple-choice multi-dimensional knapsack problem

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Greedy algorithm for the general multidimensional knapsack problem

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