Data dependent worst case bound improving techniques in zero-one programming
Date
1991
Authors
Oğuz, Osman
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
European Journal of Operational Research
Print ISSN
0377-2217
Electronic ISSN
1872-6860
Publisher
Elsevier BV
Volume
51
Issue
3
Pages
400 - 404
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
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.