Regular Decomposition in Integer Programming
Received:June 07, 2017  Revised:July 20, 2017
Key Words: integer programming   regular decompositions   binomial ideal   universal Gr\"{o}bner bases   state polytope  
Fund Project:Supported by the National Natural Science Foundation of China (Grant Nos.11671068; 11271060), Fundamental Research of Civil Aircraft (Grant No.MJ-F-2012-04) and the Fundamental Research Funds for the Central Universities (Grant No.DUT16LK38).
Author NameAffiliation
Han WANG School of Mathematical Sciences, Dalian University of Technology, Liaoning 116024, P. R. China 
Chungang ZHU School of Mathematical Sciences, Dalian University of Technology, Liaoning 116024, P. R. China 
Hits: 2167
Download times: 1804
Abstract:
      
Citation:
DOI:10.3770/j.issn:2095-2651.2018.02.009
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.