Pages that link to "Item:Q5623536"
From MaRDI portal
The following pages link to Finding the <i>K</i> Shortest Loopless Paths in a Network (Q5623536):
Displaying 50 items.
- The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← links)
- Fast computation of bounds for two-terminal network reliability (Q296891) (← links)
- Optimal deployment of alternative fueling stations on transportation networks considering deviation paths (Q301092) (← links)
- The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
- Multiple-path selection for new highway alignments using discrete algorithms (Q320693) (← links)
- Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs (Q336675) (← links)
- Generalized route planning model for hazardous material transportation with VaR and equity considerations (Q336917) (← links)
- On discrete optimization with ordering (Q367635) (← links)
- Algorithms for the quickest path problem and the reliable quickest path problem (Q373197) (← links)
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths (Q420803) (← links)
- An exact algorithm for the network pricing problem (Q429686) (← links)
- An efficient time and space \(K\) point-to-point shortest simple paths algorithm (Q449479) (← links)
- A multiobjective evolutionary algorithm based on decomposition with normal boundary intersection for traffic grooming in optical networks (Q508769) (← links)
- ATM VP-based network design (Q596263) (← links)
- Optimization and probabilistic satisfiability on nested and co-nested formulas (Q646722) (← links)
- Assessing the reliability and the expected performance of a network under disaster risk (Q647517) (← links)
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation (Q693801) (← links)
- A parametric approach to solving bicriterion shortest path problems (Q810382) (← links)
- \(k\)-shortest routing of trains on shunting yards (Q841591) (← links)
- Finding minimum and equitable risk routes for hazmat shipments (Q856784) (← links)
- Routing of a hazmat truck in the presence of weather systems (Q856789) (← links)
- How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis (Q887851) (← links)
- The equity constrained shortest path problem (Q910348) (← links)
- Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm (Q926599) (← links)
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs (Q959515) (← links)
- An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs (Q975758) (← links)
- A route set construction algorithm for the transit network design problem (Q1010301) (← links)
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version (Q1040964) (← links)
- On the \(K\) shortest path trees problem (Q1040982) (← links)
- Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
- An algorithm for ranking paths in acyclic networks (Q1050909) (← links)
- Allowable processing orders in the accelerated cascade algorithm (Q1072941) (← links)
- An algorithm for finding the \(k\) quickest paths in a network (Q1201855) (← links)
- Ein neuer Algorithmus zur Bestimmung von k-kürzesten Wegen in einem Graphen (Q1226856) (← links)
- Ein Verfahren zur Alternativroutensuche in Verkehrsnetzen (Q1257830) (← links)
- Neural and delay based heuristics for the Steiner problem in networks (Q1296029) (← links)
- An algorithm for the ranking of shortest paths (Q1309941) (← links)
- Finding the \(k\) quickest simple paths in a network (Q1322119) (← links)
- Ein leistungsfähiger Algorithmus zur Bestimmung von K-kürzesten Wegen in einem Graphen (Q1394122) (← links)
- Finding the first \(K\) shortest paths in a time-window network. (Q1427091) (← links)
- Heuristics for the stochastic/dynamic user-optimal route choice problem (Q1584809) (← links)
- Unified approach to fuzzy graph problems (Q1602881) (← links)
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem (Q1615965) (← links)
- Targeted and contextual redescription set exploration (Q1631833) (← links)
- Computing and listing \(st\)-paths in public transportation networks (Q1635813) (← links)
- Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation (Q1642944) (← links)
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem (Q1651593) (← links)
- Integrated approach to network design and frequency setting problem in railway rapid transit systems (Q1652202) (← links)
- Congestion avoiding heuristic path generation for the proactive route guidance (Q1654374) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
