| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10348469 | Computers & Operations Research | 2005 | 21 Pages |
Abstract
In this paper we present procedures for finding the K shortest hyperpaths in a directed hypergraph. This is done by extending existing algorithms for K shortest loopless paths. Computational experiments on the proposed procedures are performed, and applications in transportation, planning and combinatorial optimization are discussed.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani,