Regular decomposition in integer programming
Received:June 07, 2017  Revised:June 26, 2017
Key Word: Integer programming, Regular decompositions, Binomial ideal, Universal Groebner bases, State polytope  
Fund ProjectL:National Natural Science Foundation of China (Nos. 11671068, 11271060), Fundamental Research of Civil Aircraft (No. MJ-F-2012-04), and the Fundamental Research Funds for the Central Universities (No. DUT16LK38).
Author NameAffiliationE-mail
Han Wang 大连理工大学数学科学学院 wh2014@mail.dlut.edu.cn 
Chungang Zhu 大连理工大学数学科学学院 cgzhu@dlut.edu.cn 
Hits: 25
Download times: 
Abstract:
      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.
Citation:
DOI:
View Full Text  View/Add Comment  Download reader