Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Speaker: | Ahmad Abdi |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics and Computer Building (MC) 6486 |
The set packing and set covering polyhedra are two of the most fundamental objects in combinatorial optimization. More than 50 years of studying the different properties of these objects has led to many beautiful theories and spectacular results, such as Fulkerson's theory of blocking and anti-blocking polyhedra, the different perfect graph theorems, characterization of ideal matrices, matroids with the max-flow min-cut property, characterization of weakly bipartite graphs, and many more.
In this talk, I will give an overview of these results, and explain the striking differences between the two objects that makes the set covering polyhedron much more complex than the other one. I will also talk about some recent progress towards understanding these polyhedra.
Some of the results are based on joint works with A. Feldmann,
R. Fukasawa, B. Guenin, J. Könemann and L. Sanità.
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is co-ordinated within the Office of Indigenous Relations.