The complexity of the network design problem
Year of publication: |
1977
|
---|---|
Authors: | Johnson, D. S. ; Lenstra, J. K. ; Rinnooy Kan, A. H. G. |
Publisher: |
Rotterdam : Econometric Inst., Univ. |
Subject: | Projektplanung | Unternehmensnetzwerk | Business network | Theorie | Theory | Netzwerk | Network | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming |
Extent: | 6 S |
---|---|
Series: | Report / Econometric Institute, Erasmus University Rotterdam. - Rotterdam, ZDB-ID 863806-8. - Vol. 7721/MO |
Type of publication: | Book / Working Paper |
Type of publication (narrower categories): | Arbeitspapier ; Working Paper |
Language: | English |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Approximate Submodularity in Network Design Problems
DeValve, Levi, (2021)
-
Incremental network design with maximum flows
Kalinowski, Thomas, (2015)
-
Yamada, Tadashi, (2015)
- More ...
-
Lenstra, J. K., (1979)
-
Complexity results for scheduling chains on a single machine
Lenstra, J. K., (1980)
-
An appraisal of computational complexity for operations researchers
Lenstra, J. K., (1982)
- More ...