Pitch, extension complexity, and covering problems
Daniel Bienstock, Yuri Faenza, Xuan Zhang
| Year of publication: |
2021
|
|---|---|
| Authors: | Bienstock, Daniel ; Faenza, Yuri ; Zhang, Xuan |
| Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 3, p. 357-364
|
| Subject: | Bounded pitch | Covering problem | Extension complexity | Minimum knapsack | Separation algorithm | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.orl.2021.03.006 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012591633