An application of an optimal behaviour of the greedy solution in number theory

Simple item page
dc.citation.epage83en_US
dc.citation.issueNumber2en_US
dc.citation.spage69en_US
dc.citation.volumeNumber27en_US
dc.contributor.authorVizvári, B.en_US
dc.date.accessioned2016-02-08T10:54:02Z
dc.date.available2016-02-08T10:54:02Z
dc.date.issued1993en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractLet a1, a2, ..., an be relative prime positive integers. The Frobenius problem is to determine the greatest integer not belonging to the set {Σj=1 najxj :x∈Z+ n}. The Frobenius problem belongs to the combinatorial number theory, which is very rich in methods. In this paper the Frobenius problem is handled by integer programming which is a new tool in this field. Some new upper bounds and exact solutions of subproblems are provided. A lot of earlier results obtained with very different methods can be discussed in a unified way.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:54:02Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1993en
dc.identifier.doi10.1007/BF01876632en_US
dc.identifier.eissn1588-2829
dc.identifier.issn0031-5303
dc.identifier.urihttp://hdl.handle.net/11693/26032
dc.language.isoEnglishen_US
dc.publisherAkademiai Kiado Rt.en_US
dc.relation.isversionofhttps://doi.org/10.1007/BF01876632en_US
dc.source.titlePeriodica Mathematica Hungaricaen_US
dc.subjectFrobenius problemen_US
dc.subjectGreedy solutionen_US
dc.subjectInteger programingen_US
dc.titleAn application of an optimal behaviour of the greedy solution in number theoryen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
An-application-of-an-optimal-behaviour-of-the-greedy-solution-in-number-theory.pdf
Size:
561.69 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Industrial Engineering