Regular decomposition in integer programming
Regular decomposition in integer programming
投稿时间:2017-06-07  最后修改时间:2017-06-26
DOI:
中文关键词:  
英文关键词:Integer programming, Regular decompositions, Binomial ideal, Universal Groebner bases, State polytope
基金项目:
作者单位E-mail
王涵 大连理工大学数学科学学院 wh2014@mail.dlut.edu.cn 
朱春钢 大连理工大学数学科学学院 cgzhu@dlut.edu.cn 
摘要点击次数: 74
全文下载次数: 
中文摘要:
      
英文摘要:
      In this paper, we study the problem of regular decompositions in integer programming. We provide a method to get the regular decomposition forms by the radical of binomial ideal and universal Grobner bases. We indicate the relationship between state polytope and regular decompositions, i.e., an edge of state polytope corresponds to a binomial which decides one of regular decomposition forms of a nite integer lattice point set.
查看全文  查看/发表评论  下载PDF阅读器