The following pages link to (Q4955272):
Displaying 14 items.
- Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
- The path-variance problem on tree networks (Q705500) (← links)
- Urban rapid transit network design: accelerated Benders decomposition (Q839775) (← links)
- Location-routing: issues, models and methods (Q856260) (← links)
- Optimal design of hierarchical networks with free main path extremes (Q943800) (← links)
- Location of infrastructure in urban railway networks (Q960393) (← links)
- Heuristic algorithms for the multi-depot ring-star problem (Q1043363) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Optimization methods for the planning of rapid transit systems (Q1971985) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- A branch-and-cut algorithm for the median-path problem (Q2490367) (← links)
- Metaheuristics and cooperative approaches for the bi-objective ring star problem (Q2654392) (← links)
- An exact algorithm for solving the ring star problem (Q3553757) (← links)
