Analysis of discrete algorithms using the Diophantine equations for efficient problem solving
Amit Gargamit.garg@jaipur.manipal.eduDepartment of Computer Science and EngineeringManipal University JaipurJaipur, Rajasthan, 303007, IndiaView full profile → , Kirti Bikramkirti.bikram@symlaw.ac.inSymbiosis Law School Pune (SLS-P)Symbiosis Centre for Advanced Legal Studies and Research (SCALSAR), Symbiosis International (Deemed University)Pune, Maharashtra, 411014, IndiaView full profile → , Kumari Shiprakumari.shipra@niu.edu.inDepartment of School of Engineering & TechnologyNoida International UniversityGreater Noida, Uttar Pradesh, 203201, IndiaView full profile → , *Ambuj Kumar AgarwalCorresponding authorambuj4u@gmail.comDepartment of Computer Science and EngineeringSharda School of Engineering and TechnologySharda UniversityGreater Noida, Uttar Pradesh, 201306, IndiaView full profile → , P. Aravindarvindppp@gmail.comDepartment of Computer Science and EngineeringKKR and KSR Institute of Technology and SciencesGuntur, Andhra Pradesh, 522017, IndiaView full profile → , Ginni Nijhawanginni.nijhawan@lpu.co.inMittal School of BusinessLovely Professional UniversityPhagwara, Punjab, 144411, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 09 Apr 2025
- Published Online:
- 07 Feb 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2490
- Pages:
- 505–513
Abstract
Keywords
Subject Classifications
References
[1] V. Cacchiani, M. Iori, A. Locatelli, and S. Martello, “Knapsack problems—An overview of recent advances. Part I: Single knapsack problems,” Comput. Oper. Res., vol. 143, p. 105692 (2022).
[2] V. Cacchiani, M. Iori, A. Locatelli, and S. Martello, “Knapsack problems—An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems,” Comput. Oper. Res., vol. 143, p. 105693 (2022).
[3] K. Jansen and L. Rohwedder, “On integer programming and convolution,” Math. Oper. Res., vol. 48, pp. 1481–1495 (2023).
[4] S. S. Dey, Y. Dubey, and M. Molinaro, “Branch-and-bound solves random binary IPs in poly(n)-time,” Math. Program., vol. 200, pp. 569–587 (2023).
[5] A. M. del Rey and A. Q. de Dios, “Cryptographic protocols in wireless sensor networks: A critical review,” Proc., vol. 1, p. 748 (2017).
[6] F. K. Batista, A. Martín del Rey, and A. Queiruga-Dios, “A new individual-based model to simulate malware propagation in wireless sensor networks,” Mathematics, vol. 8, p. 410 (2020).
[7] V. G. Martínez, L. Hernández-Álvarez, and L. H. Encinas, “Analysis of the cryptographic tools for blockchain and Bitcoin,” Mathematics, vol. 8, p. 131 (2020).
[8] G. Alecci and S. Dutto, “Pell hyperbolas in DLP based cryptosystems,” arXiv preprint, arXiv:2111.09632 (2021).
[9] J. C. Vanikar, S. B. Patil, A. S. Banait, V. Khetani, G. Gondhalekar, and Y. Gandhi, “Shaping the future of leadership through the complex role of management sciences,” J. Inf. Optim. Sci., vol. 46, no. 4-B, pp. 1189–1198 (2025).
[10] P. Karthikeyan and P. Mani, “Applying Dijkstra algorithm for solving spherical fuzzy shortest path problem,” Solid State Technol., vol. 63, pp. 4239–4250 (2020).
[11] A. Bennett and J. Clarke, “Distributed ledger technology for decentralized identity management,” Int. J. Adv. Electr. Comput. Eng., vol. 13, no. 2, pp. 16–23 (2025).
[12] M. Parimala, S. Broumi, K. Prakash, and S. Topal, “Bellman-Ford algorithm for solving shortest path problem of a network under picture fuzzy environment,” Complex Intell. Syst. (2021).
