Numerical solution of certain exponential and non-linear Diophantine systems of equations by using a discrete particle swarm optimization algorithm
From MaRDI portal
Publication:275842
DOI10.1016/j.amc.2013.10.007zbMath1334.65105OpenAlexW2025512118MaRDI QIDQ275842
Rodrigo Correa, Iván Amaya, Oscar Pérez
Publication date: 26 April 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.10.007
Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Novel bees algorithm: stochastic self-adaptive neighborhood ⋮ Ising Machines for Diophantine Problems in Physics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving some parametric quadratic Diophantine equation over \(\mathbb Z\) and \(\mathbb F_p\)
- The decision problem for exponential diophantine equations
- A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
- Finding numerical solutions of Diophantine equations using ant colony optimization
- Solving Exponential Diophantine Equations
This page was built for publication: Numerical solution of certain exponential and non-linear Diophantine systems of equations by using a discrete particle swarm optimization algorithm