The cutting plane method is polynomial for perfect matchings
Karthekeyan Chandrasekaran (Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Champaign, Illinois), László A. Végh (Department of Management, London School of Economics, London, United Kingdom), Santosh S. Vempala (College of Computing, Georgia Institute of Technology, Atlanta, Georgia)
| Year of publication: |
February 2016
|
|---|---|
| Authors: | Chandrasekaran, Karthekeyan ; Végh, László A. ; Vempala, Santosh S. |
| Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 41.2016, 1, p. 23-48
|
| Subject: | integer programs | cutting planes | linear programs | matchings | blossom inequalities | graph theory | half-integrality | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Matching |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/moor.2015.0714 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011448284