An application of Gomory cuts in number theory

DOI10.1007/BF01848085zbMATH Open0626.10013MaRDI QIDQ580401FDOQ580401

Authors: B. Vizvári 

Publication date: 1987

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

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

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)

Cites Work

• Title not available (Why is that?)
• On the linear diophantine problem of Frobenius.
• Title not available (Why is that?)

Cited In (4)

• An application of an optimal behaviour of the greedy solution in number theory
• Lattice translates of a polytope and the Frobenius problem
• Two algorithms to get strong Gomory cuts
• 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)