Show simple item record

dc.contributor.authorVizvári, Belaen_US
dc.date.accessioned2016-02-08T10:55:37Z
dc.date.available2016-02-08T10:55:37Z
dc.date.issued1992en_US
dc.identifier.issn0233-1934en_US
dc.identifier.urihttp://hdl.handle.net/11693/26139
dc.description.abstractIn this paper we submit a unified discussion of some closely related results which were achieved independently in number theory and integer programming, and we partially generalize them. In the unified discussion we treat together two problems where the greedy method has different characters, in the first one it is an internal-point algorithm, in the second one it is an outer-point method. We call a knapsack problem “pleasant” if the greedy solution is optimal for every right-hand side. A sufficient and two finite necessary and sufficient conditions for the pleasantness of a problem are discussed. The sufficient condition can be checked very easily. The paper is finished with an error analysis of some nonpleasant problems. AMS 1980 Subject Classification: Primary: 90C 10.en_US
dc.language.isoEnglishen_US
dc.source.titleOptimizationen_US
dc.relation.isversionofhttp://dx.doi.org/10.1080/02331939208843752en_US
dc.subjectCombinatorial optimizationen_US
dc.subjectGreedy methoden_US
dc.subjectKnapsack problemsen_US
dc.titleOn the optimality of the greedy solutions of the general knapsack problemsen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage125en_US
dc.citation.epage138en_US
dc.citation.volumeNumber23en_US
dc.citation.issueNumber2en_US
dc.identifier.doi10.1080/02331939208843752en_US
dc.publisherTaylor & Francis
dc.identifier.eissn1029-4945en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record