Pages that link to "Item:Q795755"
From MaRDI portal
The following pages link to Shortest paths in networks with vector weights (Q795755):
Displayed 17 items.
- Routing with nonlinear multiattribute cost functions (Q686201) (← links)
- Efficient spanning trees (Q796551) (← links)
- A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
- An organizing principle for dynamic estimation (Q1117890) (← links)
- A multicriteria Pareto-optimal path algorithm (Q1196025) (← links)
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite (Q1598722) (← links)
- Multiobjective routing problems (Q1919112) (← links)
- Modified algorithm to compute Pareto-optimal vectors (Q1969470) (← links)
- Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← links)
- Multiobjective routing of hazardous materials in stochastic networks (Q2368293) (← links)
- Algorithms for time-dependent bicriteria shortest path problems (Q2465939) (← links)
- New algorithms for multi objective shortest path problem. (Q2477107) (← links)
- Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770) (← links)
- New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems (Q4653708) (← links)
- A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set (Q4809666) (← links)
- (Q4945108) (← links)
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)