Pages that link to "Item:Q3030602"

The following pages link to The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks (Q3030602):

Displaying 29 items.

• Rapid transit network design for optimal cost and origin-destination demand capture (Q336685) (← links)
• The transit route arc-node service maximization problem (Q621660) (← links)
• The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives (Q651306) (← links)
• Locating stops along bus or railway lines -- a bicriteria problem (Q816419) (← links)
• An interactive approach to identify the best compromise solution for two objective shortest path problems (Q912767) (← links)
• A minimum length covering subgraph of a network (Q920001) (← links)
• Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
• Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
• The tricriterion shortest path problem with at least two bottleneck objective functions (Q1026760) (← links)
• Locating concentrators in centralized computer networks (Q1197789) (← links)
• On symmetric subtour problems (Q1202764) (← links)
• A review of extensive facility location in networks (Q1278421) (← links)
• Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
• A multi-modal approach to the location of a rapid transit line (Q1291658) (← links)
• The interactive analysis of the multicriteria shortest path problem by the reference point method. (Q1406958) (← links)
• Semi-obnoxious single facility location in Euclidean space. (Q1422376) (← links)
• Siting recycling drop-off stations in urban area by genetic algorithm-based fuzzy multiobjective nonlinear integer programming modeling (Q1582174) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
• Locating median cycles in networks (Q1887911) (← links)
• Multiobjective routing problems (Q1919112) (← links)
• Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← links)
• A branch-and-cut algorithm for the median-path problem (Q2490367) (← links)
• The determination of the path with minimum-cost norm value (Q4419275) (← links)
• An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem (Q4764857) (← links)
• Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
• An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem (Q5084630) (← links)
• Label correcting methods to solve multicriteria shortest path problems (Q5956971) (← links)
• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation (Q6047913) (← links)