Oğuz, Osman2016-02-082016-02-0819910377-2217http://hdl.handle.net/11693/26171A 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.EnglishHeuristicsKnapsackZero-one programmingComputer programming, algorithmsOperations researchApproximation algorithmHeuristicsKnapsack problemZero-One programmingMathematical programmingData dependent worst case bound improving techniques in zero-one programmingArticle10.1016/0377-2217(91)90314-L1872-6860