A class of generalized greedy algorithms for the multi-knapsack problem
DOI10.1016/0166-218X(93)90051-OzbMATH Open0785.90072OpenAlexW2077554072MaRDI QIDQ1803680FDOQ1803680
L. Stougie, Alexander H. G. Rinnooy Kan, C. Vercellis
Publication date: 29 June 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)90051-o
Recommendations
heuristicsapproximate solutionsupper boundworst casegeneralized greedy algorithmsmulti-knapsack problemprobabilistic performance analysis
Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)
Cites Work
- Probability Inequalities for Sums of Bounded Random Variables
- Title not available (Why is that?)
- Stochastic on-line knapsack problems
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Title not available (Why is that?)
- A probabilistic analysis of the multiknapsack value function
- Title not available (Why is that?)
- Two Lines Least Squares
Cited In (28)
- Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems.
- On rates of convergence and asymptotic normality in the multiknapsack problem
- LP based heuristics for the multiple knapsack problem with assignment restrictions
- Greedy algorithm for the general multidimensional knapsack problem
- A generalisation of an algorithm solving the fuzzy multiple choice knapsack problem
- Revenue management in make-to-order manufacturing-an application to the iron and steel industry
- Average performance of greedy heuristics for the integer knapsack problem.
- Network capacity control using self-adjusting bid-prices
- Title not available (Why is that?)
- Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
- A Markov model for single-leg air cargo revenue management under a bid-price policy
- Constrained multi-project planning problems: A Lagrangean decomposition approach
- Heuristics for multi-item two-echelon spare parts inventory control subject to aggregate and individual service measures
- The air-cargo consolidation problem with pivot weight: models and solution methods
- Title not available (Why is that?)
- An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition
- Title not available (Why is that?)
- The multidimensional 0-1 knapsack problem: an overview.
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A probabilistic analysis of the multi-period single-sourcing problem
- A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem
- A class of greedy algorithms for the generalized assignment problem
- Title not available (Why is that?)
- Joint performance of greedy heuristics for the integer knapsack problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- The average behaviour of greedy algorithms for the knapsack problem: general distributions
- Connectivity and stochastic robustness of synchronized multi-drone systems
This page was built for publication: A class of generalized greedy algorithms for the multi-knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803680)
