Use of Extended Euclidean Algorithm in Solving a System of Linear Diophantine Equations with Bounded Variables

No abstract is available for this paper.

• Publication year

  2006

• Venue

  International Workshop on Ant Colony Optimization and Swarm Intelligence

• Publication date

  2006-07-23

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/11792086_14
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Refined upper bounds for the linear Diophantine problem of Frobenius

  2003cited by this paper
• Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables

  2000cited by this paper
• A Fast Method for Finding the Basis of Nonnegative Solutions to a Linear Diophantine Equation

  1995cited by this paper
• Solution to a Linear Diophantine Equation for Nonnegative Integers

  1988cited by this paper
• Theory of linear and integer programming

  1986cited by this paper
• The Linear Diophantine Equation

  1981cited by this paper
• Using the Blankinship algorithm to find the general solution of a linear diophantine equation

  1980cited by this paper
• On the linear diophantine problem of Frobenius in three variables.

  1978cited by this paper
• Bounds for a Linear Diophantine Problem of Frobenius, II

  1975cited by this paper
• On a linear diophantine problem of Frobenius

  1972cited by this paper
• Calculating the General Solution of a Linear Diophantine Equation

  1967cited by this paper

• Efficient algorithm for linear diophantine equations in two variables

  2025cites this paper
• Off-Chip Memory Allocation for Neural Processing Units

  2024cites this paper
• An average case efficient algorithm for solving two variable linear diophantine equations

  2024cites this paper
• Layouts of Unit-Load Warehouses with Multiple Slot Heights

  2020cites this paper
• Maximizing space utilization in unit-load warehouses.

  2019cites this paper
• Reachability determination in acyclic Petri nets by cell enumeration approach

  2011cites this paper
• The FPGA implementation of multiplicative inverse value of GF(28) generator using Extended Euclid Algorithm (EEA) method for Advanced Encryption Standard (AES) algorithm

  2011cites this paper
• A Novel Method for Reachability Determination in Petri Nets

  2009cites this paper