Paola B. Tolomei

Learn More
The dominating set polyhedron of a web graph W k n is the set covering polyhedron of a circulant matrix C2k+1 n . Working on the set covering polyhedron of general circulant matrices, Argiroffo and Bianchi found a class of valid inequalities, induced by a particular family of circulant minors. The authors also identified sufficient conditions on the minors(More)
  • 1