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

Files

Data_dependent_worst_case_bound_improving_techniques_in_zero—one_programming.pdf (310.18 KB)

Date

1991

Authors

Oğuz, Osman

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
0
views
10
downloads

Citation Stats

  • Share

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

Keywords

Heuristics, Knapsack, Zero-one programming, Computer programming, algorithms, Operations research, Approximation algorithm, Heuristics, Knapsack problem, Zero-One programming, Mathematical programming

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/26171

Published Version (Please cite this version)

http://dx.doi.org/10.1016/0377-2217(91)90314-L

Collections

Scholarly Publications - Industrial Engineering

Language

English

Type

Article