Data dependent worst case bound improving techniques in zero-one programming
European Journal of Operational Research
400 - 404
Item Usage Stats
MetadataShow full item record
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.
Computer programming, algorithms
Published Version (Please cite this version)http://dx.doi.org/10.1016/0377-2217(91)90314-L
Showing items related by title, author, creator and subject.
Dedeoǧlu, M.; Alp, Y.K.; Arikan, O. (IEEE Computer Society, 2014)Finite impulse response (FIR) filters have been a primary topic of digital signal processing since their inception. Although FIR filter design is an old problem, with the developments of fast convex solvers, convex modelling ...
Cicekli, I. (Elsevier, 1998)A compiler-based meta-level system for MetaProlog language is presented. Since MetaProlog is a meta-level extension of Prolog, the Warren Abstract Machine (WAM) is extended to get an efficient implementation of meta-level ...
Kian R.; Kargar K. (Elsevier, 2016)In this paper, we study the hub location problem with a power-law congestion cost and propose an exact solution approach. We formulate this problem in a conic quadratic form and use a strengthening method which rests on ...