A stability concept for zero-one knapsack problems and approximation algorithms

Simple item page
dc.citation.epage132en_US
dc.citation.issueNumber2en_US
dc.citation.spage123en_US
dc.citation.volumeNumber33en_US
dc.contributor.authorOğuz, O.en_US
dc.contributor.authorMagazine, M. J.en_US
dc.date.accessioned2019-02-04T07:46:08Z
dc.date.available2019-02-04T07:46:08Z
dc.date.issued1995en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractThe concept of reducing the feasible range of decision variables or fixing the value of the variables is extended for the knapsack problem to include sets of variables. The ease of fixing these variables is measured by a stability index. The potential use of the concept is discussed in the context of approximation algorithms. Generalization to general zero-one problems is also considered.en_US
dc.identifier.doi10.1080/03155986.1995.11732274en_US
dc.identifier.eissn1916-0615
dc.identifier.issn0315-5986
dc.identifier.urihttp://hdl.handle.net/11693/48771
dc.language.isoEnglishen_US
dc.publisherTaylor & Francisen_US
dc.relation.isversionofhttps://doi.org/10.1080/03155986.1995.11732274en_US
dc.source.titleINFOR : Information Systems and Operational Researchen_US
dc.subjectKnapsack problemsen_US
dc.subjectApproximation algorithmsen_US
dc.titleA stability concept for zero-one knapsack problems and approximation algorithmsen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_stability_concept_for_zero_one_knapsack_problems_and_approximation_algorithms.pdf
Size:
807.2 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Scholarly Publications - Industrial Engineering