The average behaviour of greedy algorithms for the knapsack problem: general distributions
From MaRDI portal
Publication:1423700
DOI10.1007/S001860200270zbMath1175.90328OpenAlexW1541296334MaRDI QIDQ1423700
Gennady Diubin, Alexander Korbut
Publication date: 7 March 2004
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: http://edoc.hu-berlin.de/18452/3310
Programming involving graphs or networks (90C35) Stochastic programming (90C15) Combinatorial optimization (90C27)
Related Items (5)
Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions ⋮ Average behavior of greedy algorithms for the minimization knapsack problem: General coefficient distributions ⋮ Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation ⋮ Optimal setup of a multihead weighing machine ⋮ Average-case performance of rollout algorithms for knapsack problems
This page was built for publication: The average behaviour of greedy algorithms for the knapsack problem: general distributions
