Greedy algorithm for the general multidimensional knapsack problem
From MaRDI portal
Publication:2480198
DOI10.1007/S10479-006-0150-4zbMATH Open1144.90466OpenAlexW1972314001MaRDI QIDQ2480198FDOQ2480198
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial auctions: a survey
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- Approximation algorithms for knapsack problems with cardinality constraints
- Optimal project selection: Stochastic knapsack with finite time horizon
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- A genetic algorithm for the multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
Cited In (16)
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
- Optimal targeted mass screening in non‐uniform populations with multiple tests and schemes
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
- New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
- A Stackelberg knapsack game with weight control
- A RNN-based hyper-heuristic for combinatorial problems
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- A total-value greedy heuristic for the integer knapsack problem
- Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence
- Optimal allocation of stock levels and stochastic customer demands to a capacitated resource
Uses Software
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)
