Pages that link to "Item:Q1166423"
From MaRDI portal
The following pages link to A bicriterion shortest path algorithm (Q1166423):
Displayed 39 items.
- 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)
- 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 empirical investigation of some bicriterion shortest path algorithms (Q1823874) (← links)
- Multiobjective routing problems (Q1919112) (← 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)
- Multiobjective routing of hazardous materials in stochastic networks (Q2368293) (← links)
- Computing all efficient solutions of the biobjective minimum spanning tree problem (Q2384598) (← links)
- A new multiobjective dynamic routing method for multiservice networks: modelling and performance (Q2468381) (← links)
- Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770) (← links)
- Relation betwen integer linear vector optimization and multicriteria problems on groups and graphs (Q2785391) (← 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)
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)
- An algorithm to determine a path with minimal cost/capacity ratio (Q5902840) (← links)
- An algorithm to determine a path with minimal cost/capacity ratio (Q5904728) (← links)
- Label correcting methods to solve multicriteria shortest path problems (Q5956971) (← links)