Pages that link to "Item:Q1977617"

The following pages link to A label correcting approach for solving bicriterion shortest-path problems (Q1977617):

Displaying 50 items.

• Finding reliable shortest paths in road networks under uncertainty (Q264260) (← links)
• Generic constraints handling techniques in constrained multi-criteria optimization and its application (Q319412) (← links)
• Path based algorithms for metro network design (Q337631) (← links)
• A simulated annealing for multi-criteria network path problems (Q339658) (← links)
• Dimensionality reduction in multiobjective shortest path search (Q342069) (← links)
• Bicriteria path problem minimizing the cost and minimizing the number of labels (Q385462) (← links)
• Efficient solution generation for the bicriterion shortest path problems (Q606615) (← links)
• Multi-objective and multi-constrained non-additive shortest path problems (Q609807) (← links)
• An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem (Q652866) (← links)
• Minimum cost path problems with relays (Q709122) (← links)
• A parametric approach to solving bicriterion shortest path problems (Q810382) (← links)
• A biobjective optimization model for routing in mobile ad hoc networks (Q840189) (← links)
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
• Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
• Extended dominance and a stochastic shortest path problem (Q954058) (← links)
• A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
• On algorithms for the tricriteria shortest path problem with two bottleneck objective functions (Q976042) (← links)
• An interactive procedure using domination cones for bicriterion shortest path problems (Q1317170) (← links)
• The interactive analysis of the multicriteria shortest path problem by the reference point method. (Q1406958) (← links)
• Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network (Q1630202) (← links)
• A biobjective Dijkstra algorithm (Q1728479) (← links)
• Non-additive shortest path in the context of traffic assignment (Q1754328) (← links)
• The quickest path problem with interval lead times (Q1765546) (← links)
• An empirical investigation of some bicriterion shortest path algorithms (Q1823874) (← links)
• The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation (Q1869670) (← links)
• Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives (Q1877893) (← links)
• A relation of dominance for the bicriterion bus routing problem (Q2012147) (← links)
• New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
• On the cardinality of the Pareto set in bicriteria shortest path problems (Q2379876) (← links)
• Speeding up Martins' algorithm for multiple objective shortest path problems (Q2441362) (← links)
• A survey of recent developments in multiobjective optimization (Q2468335) (← links)
• An exact method for the biobjective shortest path problem for large-scale road networks (Q2630225) (← links)
• Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
• Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points (Q2664305) (← links)
• An improved multiobjective shortest path algorithm (Q2669519) (← links)
• A genetic algorithms to solve the bicriteria shortest path problem (Q2861502) (← links)
• The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization (Q2988849) (← links)
• Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem (Q3557808) (← links)
• Design of supply chain networks with multi-phased discount price and service level: formulation, complexity, and algorithm (Q3643080) (← links)
• A simple and fast label correcting algorithm for shortest paths (Q4291478) (← links)
• Extensions of labeling algorithms for multi‐objective uncertain shortest path problems (Q4687213) (← links)
• Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
• An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem (Q5084630) (← links)
• (Q5282655) (← links)
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)
• Improved smoothed analysis of multiobjective optimization (Q5415491) (← links)
• Label correcting methods to solve multicriteria shortest path problems (Q5956971) (← links)
• The smoothed number of Pareto-optimal solutions in bicriteria integer optimization (Q6044982) (← links)
• Targeted multiobjective Dijkstra algorithm (Q6139383) (← links)
• Generalized nash fairness solutions for bi‐objective minimization problems (Q6180043) (← links)