BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Cyclic Transversal Polytopes [Oberseminar Discrete Optimization]
DTSTART:20250203T171500Z
DTEND:20250203T181500Z
DTSTAMP:20260612T203300Z
UID:indico-event-140@math-events.uni-bonn.de
DESCRIPTION:Speakers: Volker Kaibel (Otto-von-Guericke-Universität Magdeb
 urg)\n\nWe introduce the class of cyclic transversal polytopes (CTP’s) a
 nd the class of lifted odd set (LOS) inequalities for CTP’s. It turns ou
 t that several well-known polytopes that are relevant in Combinatorial Opt
 imization are special cases of CTP’s\, among them matching polytopes\, s
 table set polytopes\, and cut polytopes. We then show that the LOS inequal
 ities are a common generalization of Edmonds’ inequalities for matching 
 polytopes\, the odd hole inequalities for stable set polytopes\, and the c
 ycle inequalities for cut polytopes. We furthermore discuss possibilities 
 for generating relaxation hierarchies via CTP’s\, where the first level 
 is the relaxation obtained from the LOS inequalities. \nThe talk is based
  on joint work with Jonas Frede\, Maximilian Merkert\, and Jannik Trappe.\
 n \nThe Oberseminar takes place in the Seminarraum\, 1st floor. Participa
 nts are invited to have coffee or tea in the lounge before.\n\nhttps://mat
 h-events.uni-bonn.de/event/140/
LOCATION:Arithmeum\, Lennéstr.\,  2 - Seminarraum (Arithmeum / Research I
 nstitute for Discrete Mathematics)
URL:https://math-events.uni-bonn.de/event/140/
END:VEVENT
END:VCALENDAR