Abstract
In this paper we provide new characterizing properties of TDI systems. A corollary is Sturmfels' theorem relating toric initial ideals generated by square-free monomials to unimodular triangulations. A reformulation of these test-sets to polynomial ideals actually generalizes the existence of square-free monomials to arbitrary TDI systems, providing new relations between integer programming and Grobner bases of toric ideals. We finally show that stable set polytopes of perfect graphs are characterized by a refined fan that is a triangulation consisting only of unimodular cones, a fact that endows the Weak Perfect Graph Theorem with a computationally advantageous geometric feature. Three ways of implementing the results are described and some experience about one of these is reported.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
