Faster algorithms for Frobenius numbers

zbMath1077.11085MaRDI QIDQ2571269

Jemimah Hendry, Albert Nijenhuis, Stan Wagon, Dale Beihoffer

Publication date: 1 November 2005

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/125373

zbMATH Keywords

Frobenius numbersmoney changing problempostage-stamp problem

Mathematics Subject Classification ID

Computer solution of Diophantine equations (11Y50) Graph algorithms (graph-theoretic aspects) (05C85) Linear Diophantine equations (11D04)

Related Items (16)

Unnamed Item ⋮ The Dilating Method for Cayley digraphs on finite Abelian groups ⋮ Approximation algorithms for discrete polynomial optimization ⋮ LLL-reduction for integer knapsacks ⋮ Unnamed Item ⋮ Expected Frobenius numbers ⋮ Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation ⋮ Diameters of random circulant graphs ⋮ The Frobenius Problem and Its Generalizations ⋮ An enumeration algorithm for all integers nonrepresentable by some positive integers ⋮ On the number of integer points in translated and expanded polyhedra ⋮ Computational aspects of ordered integer partitions with bounds ⋮ The asymptotic distribution of Frobenius numbers ⋮ Gaps in nonsymmetric numerical semigroups. ⋮ Using Double-Loop digraphs for solving Frobenius' Problems ⋮ Some contributions to the Frobenius' Problem

This page was built for publication: Faster algorithms for Frobenius numbers