Finding the K shortest hyperpaths

Authors:
Lars Relund Nielsen;Kim Allan Andersen;Daniele Pretolani
Affiliations:
Department of Operations Research, University of Aarhus, Ny Munkegade, Aarhus C, Denmark;Department of Management Science and Logistics, Aarhus School of Business, Aarhus V. Denmark;Dipartimento di Matematica e Informatica, Università di Camerino, Via Madonna delle Carceri, Camerino (MC), Italy
Venue:
Computers and Operations Research
Year:
2005

Citing 7
Cited 8

Graphs: theory and algorithms

Graphs: theory and algorithms
Directed hypergraphs and applications

Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Max Horn SAT and the minimum cut problem in directed hypergraphs

Mathematical Programming: Series A and B
Finding the k Shortest Paths

SIAM Journal on Computing
A Method for the Solution of the Nth Best Path Problem

Journal of the ACM (JACM)
An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions

Computers and Operations Research
Minimum Makespan Assembly Plans

Minimum Makespan Assembly Plans

Computing the throughput of Concatenation State Machines

Journal of Discrete Algorithms
Better k-best parsing

Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Finding Best k Policies

ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
N-best parsing revisited

ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Ranking policies in discrete Markov decision processes

Annals of Mathematics and Artificial Intelligence
Distilling critical attack graph surface iteratively through minimum-cost SAT solving

Proceedings of the 27th Annual Computer Security Applications Conference
Finding the K shortest hyperpaths using reoptimization

Operations Research Letters

Quantified Score

Hi-index	0.02

Visualization

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.