Pages that link to "Item:Q4918252"

The following pages link to Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252):

Displaying 17 items.

• Path based algorithms for metro network design (Q337631) (← links)
• Dimensionality reduction in multiobjective shortest path search (Q342069) (← links)
• Bicriteria path problem minimizing the cost and minimizing the number of labels (Q385462) (← links)
• A new approach for the multiobjective minimum spanning tree (Q1651644) (← links)
• Path planning and vehicle scheduling optimization for logistic distribution of hazardous materials in full container load (Q1784845) (← links)
• An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374) (← links)
• Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation (Q2150813) (← links)
• Empirical study of exact algorithms for the multi-objective spanning tree (Q2301151) (← links)
• Speeding up Martins' algorithm for multiple objective shortest path problems (Q2441362) (← links)
• An exact method for the biobjective shortest path problem for large-scale road networks (Q2630225) (← links)
• An improved multiobjective shortest path algorithm (Q2669519) (← links)
• Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem (Q2980909) (← links)
• Using MCDA to evaluate the performance of the logistics process in public hospitals: the case of a Brazilian teaching hospital (Q4608292) (← links)
• On a relaxed maximally disjoint path pair problem: a bicriteria approach (Q6069837) (← links)
• Computational comparisons of different formulations for the Stackelberg minimum spanning tree game (Q6070408) (← links)
• Finding shortest and dissimilar paths (Q6071084) (← links)
• The Steiner bi-objective shortest path problem (Q6114902) (← links)