1 citations · 2 across the 2 of their papers we have counts for
3 papers
math.OC2019★ 1 cited
The Aggregation Closure is Polyhedral for Packing and Covering Integer Programs
Kanstantsin Pashkovich, Laurent Poirrier, Haripriya Pulyassary
Recently, Bodur, Del Pia, Dey, Molinaro and Pokutta introduced the concept of aggregation cuts for packing and covering integer programs. The aggregation closure is the intersectio…
math.OC2019★ 1 cited
On the depth of cutting planes
Laurent Poirrier, James Yu
We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretic…
cs.GT2018
Three-dimensional Stable Matching with Cyclic Preferences
Kanstantsin Pashkovich, Laurent Poirrier
We consider the three-dimensional stable matching problem with cyclic preferences, a problem originally proposed by Knuth. Despite extensive study of the problem by experts from di…