Integrality gap of the hypergraphic relaxation of Steiner trees : a short proof of a 1.55 upper bound
Year of publication: |
2010
|
---|---|
Authors: | Chakrabarty, Deeparnab ; Könemann, Jochen ; Pritchard, David |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 38.2010, 6, p. 567-570
|
Subject: | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | USA | United States | Theorie | Theory |
-
Complexity of the two-stage no-wait assembly problem with setup and removal times separated
Strusevič, Vitalij Aleksandrovič, (1991)
-
Computing puiseux-series explansion via combinatorial relaxation
Murota, Kazuo, (1989)
-
An application of quantitative economic analysis to timber production scheduling problems
Holmes, Mac Reese, (1971)
- More ...
-
Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound
Chakrabarty, Deeparnab, (2010)
-
An elementary integrality proof of Rothblum's stable matching formulation
Könemann, Jochen, (2016)
-
Approximating k-hop minimum-spanning trees
Althaus, Ernst, (2005)
- More ...