Data dependent worst case bound improving techniques in zero-one programming

Data dependent worst case bound improving techniques in zero-one programming

0.00 Avg rating0 Votes
Article ID: iaor1993719
Country: Netherlands
Volume: 51
Issue: 3
Start Page Number: 400
End Page Number: 404
Publication Date: Apr 1991
Journal: European Journal of Operational Research
Authors:
Abstract:

A 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.

Reviews

Required fields are marked *. Your email address will not be published.