An application of Gomory cuts in number theory

DOI10.1007/BF01848085MaRDI QIDQ580401zbMATH OpenFDO

Authors B. Vizvári

Publication date 1987

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

zbMATH Keywords

lower boundsknapsack problemlinear Diophantine equationFrobenius problemcoin changing problemGomory's cutting plane method

Mathematics Subject Classification ID

Integer programming (90C10) The Frobenius problem (11D07) Linear Diophantine equations (11D04)

Recommendations

• Iterated Chvátal-Gomory cuts and the geometry of numbers
• Some applications of Gelfand pairs to number theory
• On some applications of GCD sums to arithmetic combinatorics
• Numerically safe Gomory mixed-integer cuts
• Cutting towers of number fields
• An application of algebraic sieve theory
• Some Applied Number Theory
• Another pedagogy for pure-integer Gomory
• An application of an optimal behaviour of the greedy solution in number theory
• Several notes on the power of Gomory-Chvátal cuts

Cites work

• scientific article; zbMATH DE number 3176160 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• On the linear diophantine problem of Frobenius.

Cited in

(4)

• An application of an optimal behaviour of the greedy solution in number theory
• Two algorithms to get strong Gomory cuts
• Lattice translates of a polytope and the Frobenius problem
• Another pedagogy for pure-integer Gomory

This page was built for publication: An application of Gomory cuts in number theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580401)