Finding the K shortest paths in a time-schedule network with constraints on arcs
Wen Jin; Shuiping Chen; Hai Jiang
| Year of publication: |
2013
|
|---|---|
| Authors: | Jin, Wen ; Chen, Shuiping ; Jiang, Hai |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 40.2013, 12, p. 2975-2982
|
| Subject: | Time-constrained network | Time-schedule network | K shortest paths | Constrained shortest paths | Netzwerk | Network | Unternehmensnetzwerk | Business network | Graphentheorie | Graph theory | Netzplantechnik | Project network techniques |
| Extent: | graph. Darst. |
|---|---|
| Type of publication: | Article |
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10010210736