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

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.

Source Title

European Journal of Operational Research

Publisher

Elsevier BV

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English