Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
From MaRDI portal
Publication:2757645
DOI10.1287/MOOR.25.3.427.12219zbMath1073.90528OpenAlexW2117504940WikidataQ94974376 ScholiaQ94974376MaRDI QIDQ2757645
Arjen K. Lenstra, Karen Aardal, Cor A. J. Hurkens
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/149454/files/149454.pdf
Integer programming (90C10) Computer solution of Diophantine equations (11Y50) Linear Diophantine equations (11D04)
Related Items (25)
A fixed point iterative approach to integer programming and its distributed computation ⋮ Column basis reduction and decomposable knapsack problems ⋮ Lattice based extended formulations for integer linear equality systems ⋮ Approximation algorithms for discrete polynomial optimization ⋮ Lattice-based algorithms for number partitioning in the hard phase ⋮ A study of lattice reformulations for integer programming ⋮ Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms ⋮ A note on Hamiltonian cycles in planar graphs ⋮ NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations ⋮ Reachability determination in acyclic Petri nets by cell enumeration approach ⋮ Preimage selective trapdoor function: how to repair an easy problem ⋮ A generalization of the integer linear infeasibility problem ⋮ Counting Solutions of Knapsack Constraints ⋮ Thinner is not always better: cascade knapsack problems ⋮ On the Consistent Path Problem ⋮ Intermediate integer programming representations using value disjunctions ⋮ Lattice Reformulation Cuts ⋮ Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices ⋮ Non-standard approaches to integer programming ⋮ Faà di Bruno's formula, lattices, and partitions ⋮ Branching on general disjunctions ⋮ Cryptanalysis of a knapsack-based probabilistic encryption scheme ⋮ A note on solving linear Diophantine systems by usingL3-reduction algorithm ⋮ On the Structure of Reduced Kernel Lattice Bases ⋮ Integer-programming software systems
This page was built for publication: Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
