Pages that link to "Item:Q790051"

The following pages link to On a multicriteria shortest path problem (Q790051):

Displaying 50 items.

• Minmax robustness for multi-objective optimization problems (Q297049) (← links)
• Multiobjective shortest path problems with lexicographic goal-based preferences (Q297067) (← links)
• Two exact algorithms for the traveling umpire problem (Q319246) (← links)
• The constrained shortest path problem with stochastic correlated link travel times (Q323479) (← links)
• Choquet optimal set in biobjective combinatorial optimization (Q336494) (← links)
• A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
• Dimensionality reduction in multiobjective shortest path search (Q342069) (← links)
• Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
• Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations (Q406645) (← links)
• Generalized multiple objective bottleneck problems (Q453049) (← links)
• Multi-objective and multi-constrained non-additive shortest path problems (Q609807) (← links)
• An aggregate label setting policy for the multi-objective shortest path problem (Q613476) (← links)
• Connectedness of efficient solutions in multiple objective combinatorial optimization (Q650207) (← links)
• An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem (Q652866) (← links)
• Routing with nonlinear multiattribute cost functions (Q686201) (← links)
• A preference-based approach to spanning trees and shortest paths problems (Q704097) (← links)
• An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
• On finding dissimilar Pareto-optimal paths (Q707132) (← links)
• Minimum cost path problems with relays (Q709122) (← links)
• Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty (Q723948) (← links)
• Bicriteria shortest path in networks of queues (Q861124) (← links)
• Lower bound sets for biobjective shortest path problems (Q905755) (← 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)
• A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
• Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms (Q976036) (← links)
• On algorithms for the tricriteria shortest path problem with two bottleneck objective functions (Q976042) (← 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)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• Analysis of multicriteria decision aid in Europe (Q1075249) (← 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)
• Connectedness of efficient solutions in multiple criteria combinatorial optimization (Q1278594) (← links)
• Time depending shortest-path problems with applications to railway networks (Q1388936) (← links)
• The interactive analysis of the multicriteria shortest path problem by the reference point method. (Q1406958) (← links)
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (Q1413848) (← links)
• Fuzzy shortest path problems incorporating interactivity among paths. (Q1426738) (← links)
• Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite (Q1598722) (← links)
• Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network (Q1630202) (← links)
• Optimization problems with color-induced budget constraints (Q1631646) (← links)
• Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
• Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem (Q1701982) (← links)
• Complexity of strict robust integer minimum cost flow problems: an overview and further results (Q1725614) (← links)
• A biobjective Dijkstra algorithm (Q1728479) (← links)
• The fuzzy shortest path length and the corresponding shortest path in a network (Q1764758) (← links)
• A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks (Q1806861) (← links)
• An empirical investigation of some bicriterion shortest path algorithms (Q1823874) (← links)
• Dynamic shortest path in stochastic dynamic networks: Ship routing problem (Q1869695) (← links)