Identically self-blocking clutters
Abdi, A.
, Cornuejols, G. & Lee, D.
(2019).
Identically self-blocking clutters.
In
Lodi, A. & Nagarajan, V.
(Eds.),
Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Proceedings
(pp. 1-12).
Springer Berlin / Heidelberg.
https://doi.org/10.1007/978-3-030-17953-3_1
, Cornuejols, G. & Lee, D.
(2019).
Identically self-blocking clutters.
In
Lodi, A. & Nagarajan, V.
(Eds.),
Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Proceedings
(pp. 1-12).
Springer Berlin / Heidelberg.
https://doi.org/10.1007/978-3-030-17953-3_1
A clutter is identically self-blocking if it is equal to its blocker. We prove that every identically self-blocking clutter different from is nonideal. Our proofs borrow tools from Gauge Duality and Quadratic Programming. Along the way we provide a new lower bound for the packing number of an arbitrary clutter.