The following pages link to (Q3835329):
Displaying 12 items.
- On the complexity of strongly connected components in directed hypergraphs (Q517789) (← links)
- User equilibrium with recourse (Q844138) (← links)
- Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
- Equilibrium model and algorithm of urban transit assignment based on augmented network (Q1047428) (← links)
- Equilibrium traffic assignment for large scale transit networks (Q1106092) (← links)
- A simplicial decomposition method for the transit equilibrium assignment problem (Q1308665) (← links)
- A directed hypergraph model for random time dependent shortest paths (Q1569934) (← links)
- Partially dynamic maintenance of minimum weight hyperpaths (Q1775013) (← links)
- Directed hypergraphs and applications (Q1803674) (← links)
- A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks (Q1806861) (← links)
- Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks (Q1869511) (← links)
- Finding the \(K\) best policies in a finite-horizon Markov decision process (Q2433472) (← links)
