Pages that link to "Item:Q795755"

The following pages link to Shortest paths in networks with vector weights (Q795755):

Displaying 28 items.

• A new algorithm to compute Pareto-optimal paths in a multi objective fuzzy weighted network (Q505166) (← links)
• Routing with nonlinear multiattribute cost functions (Q686201) (← links)
• Efficient spanning trees (Q796551) (← links)
• Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications (Q841630) (← links)
• A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
• The tricriterion shortest path problem with at least two bottleneck objective functions (Q1026760) (← 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)
• A relation of dominance for the bicriterion bus routing problem (Q2012147) (← links)
• Generalized zeon algebras: theory and application to multi-constrained path problems (Q2361017) (← 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)
• The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks (Q2943828) (← links)
• The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization (Q2988849) (← links)
• New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems (Q4653708) (← links)
• Extensions of labeling algorithms for multi‐objective uncertain shortest path problems (Q4687213) (← links)
• A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set (Q4809666) (← links)
• Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
• (Q4945108) (← links)
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)
• Improved smoothed analysis of multiobjective optimization (Q5415491) (← links)
• The smoothed number of Pareto-optimal solutions in bicriteria integer optimization (Q6044982) (← links)