Identically self-blocking clutters
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Abdi, Ahmad | ko |
| dc.contributor.author | Cornuejols, Gerard | ko |
| dc.contributor.author | Lee, Dabeen | ko |
| dc.date.accessioned | 2022-12-03T03:00:27Z | - |
| dc.date.available | 2022-12-03T03:00:27Z | - |
| dc.date.created | 2022-12-01 | - |
| dc.date.issued | 2019-05-22 | - |
| dc.identifier.citation | 19th International Conference on Integer Programming and Combinatorial Optimization, pp.1 - 12 | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/301516 | - |
| dc.description.abstract | 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. | - |
| dc.language | English | - |
| dc.publisher | Mathematical Optimization Society | - |
| dc.title | Identically self-blocking clutters | - |
| dc.type | Conference | - |
| dc.identifier.wosid | 000493314100001 | - |
| dc.identifier.scopusid | 2-s2.0-85065895615 | - |
| dc.type.rims | CONF | - |
| dc.citation.beginningpage | 1 | - |
| dc.citation.endingpage | 12 | - |
| dc.citation.publicationname | 19th International Conference on Integer Programming and Combinatorial Optimization | - |
| dc.identifier.conferencecountry | US | - |
| dc.identifier.conferencelocation | Ann Arbor | - |
| dc.identifier.doi | 10.1007/978-3-030-17953-3_1 | - |
| dc.contributor.localauthor | Lee, Dabeen | - |
| dc.contributor.nonIdAuthor | Abdi, Ahmad | - |
| dc.contributor.nonIdAuthor | Cornuejols, Gerard | - |
- 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.