Greedy algorithms for the minimization knapsack problem: average behavior
From MaRDI portal
Publication:733910
DOI10.1007/S11488-008-1003-1zbMath1192.90166OpenAlexW4229769813MaRDI QIDQ733910
Alexander Korbut, Gennady Diubin
Publication date: 19 October 2009
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11488-008-1003-1
Programming involving graphs or networks (90C35) Stochastic programming (90C15) Combinatorial optimization (90C27)
Related Items (2)
Ratios of optimal values of objective functions of the knapsack problem and its linear relaxation ⋮ On combinatorial properties of the knapsack problem
Uses Software
This page was built for publication: Greedy algorithms for the minimization knapsack problem: average behavior
