On the minimum-cost λ-edge-connected k-subgraph problem
Elham Sadeghi, Neng Fan
| Year of publication: |
October 2016
|
|---|---|
| Authors: | Sadeghi, Elham ; Fan, Neng |
| Published in: |
Computational Management Science : CMS. - Berlin : Springer, ISSN 1619-697X, ZDB-ID 2136735-8. - Vol. 13.2016, 4, p. 571-596
|
| Subject: | Edge-connected subgraph | Minimum spanning tree | Integer programming | Graph connectivity | Valid inequalities | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1007/s10287-016-0260-7 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011669606