Finding the \(K\) shortest hyperpaths

DOI10.1016/j.cor.2003.11.014zbMath1122.68482OpenAlexW2145227222MaRDI QIDQ1764762

Kim Allan Andersen, Lars Relund Nielsen, Daniele Pretolani

Publication date: 22 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.11.014

zbMATH Keywords

\(K\) shortest paths\(K\) shortest hyperpathsDirected hypergraphsNetwork programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation ⋮ Understanding the complexity of axiom pinpointing in lightweight description logics ⋮ An extended ϵ‐constraint method for a multiobjective finite‐horizon Markov decision process ⋮ Ranking policies in discrete Markov decision processes ⋮ Finding the \(K\) best policies in a finite-horizon Markov decision process ⋮ Embedding a state space model into a Markov decision process ⋮ Hypernetworks in a directed hypergraph ⋮ Computing the throughput of concatenation state machines ⋮ Minimal functional routes in directed graphs with dependent edges ⋮ Ranking paths in stochastic time-dependent networks ⋮ Finding hypernetworks in directed hypergraphs

Cites Work

• Equilibrium traffic assignment for large scale transit networks
• Multiobjective programming and planning
• An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
• Max Horn SAT and the minimum cut problem in directed hypergraphs
• A directed hypergraph model for random time dependent shortest paths
• Directed hypergraphs and applications
• Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
• A Method for the Solution of the N th Best Path Problem
• Finding the k Shortest Paths
• Bicriterion shortest hyperpaths in random time-dependent networks
• Finding the K Shortest Loopless Paths in a Network
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Unnamed Item

This page was built for publication: Finding the \(K\) shortest hyperpaths