Pages that link to "Item:Q5249002"

The following pages link to DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS (Q5249002):

Displaying 27 items.

• The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← links)
• On a bi-dimensional dynamic alternative routing method (Q555940) (← links)
• Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks (Q877588) (← 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)
• Finding non-dominated bicriteria shortest pairs of disjoint simple paths (Q1025230) (← links)
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (Q1413848) (← links)
• Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011) (← links)
• Enumerating \(K\) best paths in length order in DAGs (Q1926859) (← links)
• Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction (Q2027056) (← links)
• An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374) (← links)
• Balanced-flow algorithm for path network planning in hierarchical spaces (Q2283024) (← links)
• Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly (Q2371467) (← links)
• A comprehensive survey on the quickest path problem (Q2379862) (← links)
• Speeding up Martins' algorithm for multiple objective shortest path problems (Q2441362) (← links)
• A new multiobjective dynamic routing method for multiservice networks: modelling and performance (Q2468381) (← links)
• Suboptimal target control for hybrid automata using model predictive control (Q2496816) (← links)
• Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations (Q2676343) (← links)
• An Experimental Study on Approximating <i>k</i> Shortest Simple Paths (Q2828199) (← links)
• Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution (Q3184581) (← links)
• A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes (Q3557806) (← links)
• Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa (Q4419274) (← links)
• The determination of the path with minimum-cost norm value (Q4419275) (← links)
• A bicriterion approach for routing problems in multimedia networks (Q4419277) (← links)
• Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
• On the shortest path problem with negative cost cycles (Q5963684) (← links)
• On a relaxed maximally disjoint path pair problem: a bicriteria approach (Q6069837) (← links)