一个基于签名Groebner基的整数规划算法  

An Integer Programming Algorithm Based on Groebner Basis of Signature

作　　者：张文哲 ZHANG Wen-zhe(Department of Science and Engineering,College of Arts and Science of Hubei Normal University,Huangshi 435109,China)

机构地区：[1]湖北师范大学文理学院理工学部,湖北黄石435109

出　　处：《数学的实践与认识》2020年第16期271-277,共7页Mathematics in Practice and Theory

摘　　要：早期的Groebner基算法去冗余率较低,使得基于此的整数规划方法需要改进.随着计算Groebner基新算法的不断提出,特别是基于签名的算法的提出,大大提高了算法的去冗余率.基于此提出了一个关于签名Groebner基的整数规划算法.通过两个不同例子的计算,发现去冗余率一个为86%,另一个则有94%.The early algorithm of Groebner basis has a low rate of removing redundancy,it makes the method based on this for integer programming need to be improved.As new algorithms for computing Groebner bases are put forward constantly,especially the signaturebased ones,have improved the rate of removing redundancy greatly.This paper based on this proposes an integer programming algorithm about Groebner basis of signature.Through calculating two different examples,we find that the one's rate of removing redundancy is 86%,the other's is 94%.

关 键 词：整数规划 签名的Groebner基 算法 

分 类 号：O221.4[理学—运筹学与控制论]