On polynomial-time solvable linear Diophantine problems

DOI10.2140/MOSCOW.2019.8.357zbMath1453.11042arXiv1903.06064OpenAlexW3100609971WikidataQ127086916 ScholiaQ127086916MaRDI QIDQ2332795

Iskander M. Aliev

Publication date: 5 November 2019

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.06064

zbMATH Keywords

lattice pointspolynomial-time algorithmsFrobenius numbersmultidimensional knapsack problemasymptotic integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Computer solution of Diophantine equations (11Y50) Lattices and convex bodies (number-theoretic aspects) (11H06) Linear Diophantine equations (11D04) The Frobenius problem (11D07)

Cites Work

• On Lovász' lattice reduction and the nearest lattice point problem
• Diophantine approximations and diophantine equations
• LLL-reduction for integer knapsacks
• Some polyhedra related to combinatorial problems
• Gradient elements of the knapsack polytope
• An Introduction to the Geometry of Numbers
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• On a Problem of Partitions II
• On a Problem of Partitions

This page was built for publication: On polynomial-time solvable linear Diophantine problems