The following pages link to (Q3888874):
Displayed 44 items.
- Routing with nonlinear multiattribute cost functions (Q686201) (← links)
- A preference-based approach to spanning trees and shortest paths problems (Q704097) (← 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 linear time algorithm for the maximum capacity path problem (Q809905) (← links)
- A parametric approach to solving bicriterion shortest path problems (Q810382) (← links)
- Fuzzy shortest path problem with finite fuzzy quantities (Q864754) (← links)
- Generalized dynamic programming for multicriteria optimization (Q908857) (← 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)
- Extended dominance and a stochastic shortest path problem (Q954058) (← links)
- A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
- The shortest path problem with two objective functions (Q1077332) (← links)
- A bicriterion shortest path algorithm (Q1166423) (← links)
- A multicriteria Pareto-optimal path algorithm (Q1196025) (← links)
- An interactive procedure using domination cones for bicriterion shortest path problems (Q1317170) (← links)
- The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
- An algorithm for the quickest path problem (Q1362526) (← links)
- Paths with minimum range and ratio of arc lengths (Q1377658) (← 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)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- Fuzzy shortest path problems incorporating interactivity among paths. (Q1426738) (← links)
- Minmax regret solutions for minimax optimization problems with uncertainty (Q1591541) (← links)
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite (Q1598722) (← links)
- The quickest path problem with interval lead times (Q1765546) (← 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)
- Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562) (← links)
- Multiobjective routing of hazardous materials in stochastic networks (Q2368293) (← links)
- Decision-making based on approximate and smoothed Pareto curves (Q2371803) (← links)
- Dynamic programming and minimum risk paths (Q2432847) (← links)
- Two phase algorithms for the bi-objective assignment problem (Q2455615) (← links)
- Algorithms for time-dependent bicriteria shortest path problems (Q2465939) (← links)
- Finding representative systems for discrete bicriterion optimization problems (Q2467474) (← links)
- New algorithms for multi objective shortest path problem. (Q2477107) (← links)
- Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770) (← links)
- On uniform \(k\)-partition problems (Q2565854) (← links)
- Efficiently computing succinct trade-off curves (Q2581275) (← links)
- An algorithm to determine a path with minimal cost/capacity ratio (Q5902840) (← links)