Pages that link to "Item:Q1166423"

The following pages link to A bicriterion shortest path algorithm (Q1166423):

Displaying 50 items.

• The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← links)
• Bicriteria path problem minimizing the cost and minimizing the number of labels (Q385462) (← links)
• An efficient time and space \(K\) point-to-point shortest simple paths algorithm (Q449479) (← links)
• Solving multi-objective traffic assignment (Q490239) (← links)
• On a bi-dimensional dynamic alternative routing method (Q555940) (← links)
• Routing with nonlinear multiattribute cost functions (Q686201) (← links)
• On finding dissimilar Pareto-optimal paths (Q707132) (← links)
• On a multicriteria shortest path problem (Q790051) (← links)
• On a special class of bicriterion path problems (Q793640) (← links)
• A parametric approach to solving bicriterion shortest path problems (Q810382) (← links)
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
• An interactive approach to identify the best compromise solution for two objective shortest path problems (Q912767) (← links)
• Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
• Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network (Q948645) (← links)
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← 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)
• Finding non-dominated bicriteria shortest pairs of disjoint simple paths (Q1025230) (← links)
• Heuristics for the bi-objective path dissimilarity problem (Q1025234) (← links)
• The tricriterion shortest path problem with at least two bottleneck objective functions (Q1026760) (← links)
• On the \(K\) shortest path trees problem (Q1040982) (← links)
• An algorithm for ranking paths in acyclic networks (Q1050909) (← links)
• The shortest path problem with two objective functions (Q1077332) (← links)
• A multicriteria Pareto-optimal path algorithm (Q1196025) (← links)
• Efficient solutions for the bicriteria network flow problem (Q1202272) (← links)
• Network reduction for the acyclic constrained shortest path problem (Q1206607) (← links)
• An algorithm for the ranking of shortest paths (Q1309941) (← links)
• On the sum-max bicriterion path problem. (Q1406718) (← links)
• The interactive analysis of the multicriteria shortest path problem by the reference point method. (Q1406958) (← links)
• Computation of ideal and Nadir values and implications for their use in MCDM methods. (Q1406960) (← links)
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (Q1413848) (← links)
• Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite (Q1598722) (← links)
• An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem (Q1664248) (← links)
• Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem (Q1701982) (← links)
• An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing (Q1734819) (← links)
• Non-additive shortest path in the context of traffic assignment (Q1754328) (← links)
• An empirical investigation of some bicriterion shortest path algorithms (Q1823874) (← links)
• Multiobjective routing problems (Q1919112) (← links)
• A general decomposition approach for multi-criteria decision trees (Q1926761) (← links)
• Shortest path problems with partial information: Models and algorithms for detecting dominance (Q1969885) (← links)
• A label correcting approach for solving bicriterion shortest-path problems (Q1977617) (← links)
• Range-constrained traffic assignment with multi-modal recharge for electric vehicles (Q2005853) (← links)
• A relation of dominance for the bicriterion bus routing problem (Q2012147) (← links)
• Shortest paths with a cost constraint: a probabilistic analysis (Q2043355) (← links)
• The parallel drone scheduling problem with multiple drones and vehicles (Q2116866) (← links)
• Multiobjective routing of hazardous materials in stochastic networks (Q2368293) (← links)
• A comprehensive survey on the quickest path problem (Q2379862) (← links)
• Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)
• On the cardinality of the Pareto set in bicriteria shortest path problems (Q2379876) (← links)
• A decision-theoretic approach to robust optimization in multivalued graphs (Q2379879) (← links)