Finding the k shortest hyperpaths

by Lars Relund Nielsen , Kim Allan Andersen , Daniele Pretolani

Citations:

9 - 1 self

User correction supplied by mph

Datum	Value	Source
TITLE	Finding the k shortest hyperpaths	user correction
AUTHOR NAME	Lars Relund Nielsen	user correction
AUTHOR AFFIL	Department of Operations Research; University of Aarhus	user correction
AUTHOR ADDR	Ny Munkegade, building 530; DK-8000 Aarhus C; Denmark	user correction
AUTHOR NAME	Kim Allan Andersen	user correction
AUTHOR AFFIL	Department of Management Science and Logistics; Aarhus School of Business	user correction
AUTHOR ADDR	Fuglesangs Allé 4, DK-8210 Aarhus V; Denmark	user correction
AUTHOR NAME	Daniele Pretolani	user correction
AUTHOR AFFIL	Dipartimento di Matematica e Informatica; Università di Camerino; Via Madonna delle Carceri	user correction
AUTHOR ADDR	I-62032 Camerino (MC); Italy	user correction
ABSTRACT	The K shortest paths problem has been extensively studied for many years. Efficient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in different areas, for example in relation with routing in dynamic networks. However, the K shortest hyperpaths problem has not yet been investigated. 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.	SVM HeaderParse 0.2
CITATIONS	21 found	ParsCit 1.0