Browsing by Subject "Knapsack"
Now showing 1 - 1 of 1
Results Per Page
Sort Options
Item Open Access Data dependent worst case bound improving techniques in zero-one programming(Elsevier BV, 1991) Oğuz, OsmanA simple perturbation of data is suggested for use in conjunction with approximation algorithms for the purpose of improving the available bounds (upper and lower), and the worst case bounds. The technique does not require the approximation algorithm (heuristic) to provide a worst case bound to be applicable.