Pages that link to "Item:Q1278421"

The following pages link to A review of extensive facility location in networks (Q1278421):

Displaying 34 items.

• Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
• Sequential competitive location on networks (Q439407) (← links)
• A Lagrangian relaxation approach for expansion of a highway network (Q512983) (← links)
• The path-variance problem on tree networks (Q705500) (← links)
• Range minimization problems in path-facility location on trees (Q713326) (← links)
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
• Urban rapid transit network design: accelerated Benders decomposition (Q839775) (← links)
• Location-routing: issues, models and methods (Q856260) (← links)
• Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
• Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
• Optimal design of hierarchical networks with free main path extremes (Q943800) (← links)
• Location of infrastructure in urban railway networks (Q960393) (← links)
• Extensive facility location problems on networks with equity measures (Q1028434) (← links)
• Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869) (← links)
• Efficient solution methods for covering tree problems (Q1284598) (← links)
• Location of paths on trees with minimal eccentricity and superior section (Q1284599) (← links)
• Modelling and solving central cycle problems with integer programming. (Q1427116) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• Extensive facility location problems on networks: an updated review (Q1667394) (← links)
• The nestedness property of location problems on the line (Q1667399) (← links)
• Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
• Multiobjective routing problems (Q1919112) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
• Optimization methods for the planning of rapid transit systems (Q1971985) (← links)
• Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
• Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm (Q2192028) (← links)
• An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
• Location of speed-up subnetworks (Q2259045) (← links)
• A linear time algorithm for connected \(p\)-centdian problem on block graphs (Q2672632) (← links)
• Insertion heuristics for central cycle problems (Q3057168) (← links)
• The continuous and discrete path‐variance problems on trees (Q5191143) (← links)
• Comments on: ``Extensive facility location problems on networks: an updated review'' (Q5970232) (← links)