Finding the \(K\) shortest hyperpaths (Q1764762): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Method for the Solution of the <i>N</i> th Best Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the k Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive least-expected time paths in stochastic, time-varying transportation and data networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A directed hypergraph model for random time dependent shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective programming and planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion shortest hyperpaths in random time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max Horn SAT and the minimum cut problem in directed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium traffic assignment for large scale transit networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004084 / rank
 
Normal rank

Latest revision as of 17:38, 7 June 2024

scientific article
Language Label Description Also known as
English
Finding the \(K\) shortest hyperpaths
scientific article

    Statements

    Finding the \(K\) shortest hyperpaths (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2005
    0 references
    Network programming
    0 references
    Directed hypergraphs
    0 references
    \(K\) shortest hyperpaths
    0 references
    \(K\) shortest paths
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references