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

DOI10.1007/BF01876632zbMath0797.11032MaRDI QIDQ1321639

Béla Vizvári

Publication date: 2 June 1994

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

upper boundsgreedy algorithmFrobenius problemknapsack problemslinear diophantine equationexact solutions of subproblems

Mathematics Subject Classification ID

Integer programming (90C10) Linear Diophantine equations (11D04)

Related Items (1)

When greedy gives optimal: a unified approach

Cites Work

• Unnamed Item
• An application of Gomory cuts in number theory
• Lattice translates of a polytope and the Frobenius problem
• On a partition problem of Frobenius
• On a linear diophantine problem for geometrical type sequences
• Gaps in the exponent set of primitive matrices
• Note on Linear Forms
• When the Greedy Solution Solves a Class of Knapsack Problems
• Über lineare Formen und ein Problem von Frobenius. I.
• On the linear diophantine problem of Frobenius.
• On the optimality of the greedy solutions of the general knapsack problems

This page was built for publication: An application of an optimal behaviour of the greedy solution in number theory