Advanced search
Publication Cover
Cyber-Physical Systems Volume 9, 2023 - Issue 4
Submit an article Journal homepage
54
Views
0
CrossRef citations to date
0
Altmetric
Research Articles

Fixed-point iterative approach for solving linear Diophantine systems with bounds on the variables

Haocheng YuSchool of Electronic and Information Engineering, Suzhou University of Science and Technology, Suzhou, ChinaView further author information
,
Luyao YangSchool of Electronic and Information Engineering, Suzhou University of Science and Technology, Suzhou, ChinaView further author information
,
Jinyu DaiSchool of Electronic and Information Engineering, Suzhou University of Science and Technology, Suzhou, ChinaView further author information
,
Baoping JiangSchool of Electronic and Information Engineering, Suzhou University of Science and Technology, Suzhou, ChinaView further author information
,
Zhengtian WuSchool of Electronic and Information Engineering, Suzhou University of Science and Technology, Suzhou, ChinaCorrespondence[email protected]
View further author information
&
Shuxian ZhuSchool of Electronic and Information Engineering, Suzhou University of Science and Technology, Suzhou, ChinaCorrespondence[email protected]
View further author information
Pages 376-389 | Received 07 Nov 2021, Accepted 21 Dec 2021, Published online: 24 Jan 2022

References

  • Kannan R, Bachem A. Polynomial algorithms for computing the smith and hermite normal forms of an integer matrix. SIAM J Comput. 1979;8(4):499–507.
  • Chou T-WJ, Collins GE. Algorithms for the solution of systems of linear diophantine equations. SIAM J Comput. 1982;11(4):687–708.
  • Lenstra AK, Willem Lenstra H, Lovász L. Factoring polynomials with rational coefficients. Mathematische annalen. 1982;261(ARTICLE):515–534.
  • Havas G, Majewski BS, Matthews KR. Extended gcd and hermite normal form algorithms via lattice basis reduction. Exp Math. 1998;7(2):125–136.
  • Khorramizadeh M. Numerical experiments with the lll-based hermite normal form algorithm for solving linear diophantine systems. Int J Contemp Math Sci. 2012;7(13):599–613.
  • Breuer F, Zafeirakopoulos Z. Polyhedral omega: a new algorithm for solving linear diophantine systems. Ann Comb. 2017;21(2):211–280.
  • Aliev I, De Loera JA, Oertel T, et al. Sparse solu- tions of linear diophantine equations. SIAM J Appl Algebra Geom. 2017;1(1):239–253.
  • Brádler K. On the number of nonnegative solutions of a system of linear diophantine equations. arXiv Preprint. 2016;arXiv:1610.06387.
  • Ladzoryshyn NB, Petrychkovych VM, Zelisko HV. Matrix diophantine equations over quadratic rings and their solutions. Carpathian Math Publ. 2020;12(2):368–375.
  • Cornuéjols G, Dawande, M. A Class of Hard small 0-1 Programs, The 6th International Integer Programming and Combinatorial Optimization(IPCO), 1998 Houston, Texas, USA,- Berlin, Heidelberg: Springer1998;284–293.
  • Khorramizadeh M. A note on solving linear diophantine systems by using l 3- reduction algorithm. Int J Comput Math. 2009;86(5):883–896.
  • Aardal K.I. An algorithm for solving a diophantine equation with lower and upper bounds on the variables, 1997 Utrecht University: Information and Computing Sciences.1997.
  • Aardal K, Bixby RE, Hurkens CAJ, et al. Market split and basis reduction: towards a solution of the cornuéjols-dawande instances. INFORMS J Comput. 2000;12(3):192–202.
  • Yousefikhoshbakht M, Sedighpour M. New imperialist competitive al- gorithm to solve the travelling salesman problem. Int J Comput Math. 2013;90(7):1495–1505.
  • Yuan S-F, Yu Y-B, Ming-Zhao L, et al. A direct method to frobe- nius norm-based matrix regression. Int J Comput Math. 2020;97(9):1767–1780.
  • Dang, C. An Increasing-Mapping Approach to Integer Programming Based on Lexicographic Ordering and Linear Programming, The 9th International Symposium on Operations Research and Its Applications (ISORA), 2010, Chengdu-Jiuzhaigou, China, Lecture Notes in Operations Research: Citeseer. 2010;2:55–60.
  • Dang C, Yinyu Y. A fixed point iterative approach to integer programming and its distributed computation. Fixed Point Theory Appl. 2015;2015(1):1–15.
  • Zhengtian W, Benchi L, Dang C, et al. Solving long haul airline disruption problem caused by groundings using a distributed fixed-point computational approach to integer programming. Neurocomputing. 2017;269:232–255.
  • Huang J, Pan Q, Miao Z, et al. Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times. Eng Appl Artifi Intell. 2021;97:104016.
  • Mao J, Pan Q, Miao Z, et al. An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flow- shop scheduling problem with preventive maintenance. Expert Syst Appl. 2021;169:114495.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.