Identically self-blocking clutters
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.
- Publisher
- Mathematical Optimization Society
- Issue Date
- 2019-05-22
- Language
- English
- Citation
19th International Conference on Integer Programming and Combinatorial Optimization, pp.1 - 12
- ISSN
- 0302-9743
- Appears in Collection
- IE-Conference Papers(학술회의논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 7 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.