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

dc.citation.epage404en_US
dc.citation.issueNumber3en_US
dc.citation.spage400en_US
dc.citation.volumeNumber51en_US
dc.contributor.authorOğuz, Osmanen_US
dc.date.accessioned2016-02-08T10:56:02Z
dc.date.available2016-02-08T10:56:02Z
dc.date.issued1991en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractA 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.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:56:02Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1991en
dc.identifier.doi10.1016/0377-2217(91)90314-Len_US
dc.identifier.eissn1872-6860en_US
dc.identifier.issn0377-2217en_US
dc.identifier.urihttp://hdl.handle.net/11693/26171
dc.language.isoEnglishen_US
dc.publisherElsevier BVen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/0377-2217(91)90314-Len_US
dc.source.titleEuropean Journal of Operational Researchen_US
dc.subjectHeuristicsen_US
dc.subjectKnapsacken_US
dc.subjectZero-one programmingen_US
dc.subjectComputer programming, algorithmsen_US
dc.subjectOperations researchen_US
dc.subjectApproximation algorithmen_US
dc.subjectHeuristicsen_US
dc.subjectKnapsack problemen_US
dc.subjectZero-One programmingen_US
dc.subjectMathematical programmingen_US
dc.titleData dependent worst case bound improving techniques in zero-one programmingen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Data_dependent_worst_case_bound_improving_techniques_in_zero—one_programming.pdf
Size:
310.18 KB
Format:
Adobe Portable Document Format
Description: