The following pages link to The tree of hubs location problem (Q1039782):
Displaying 50 items.
- Hub location problems with price sensitive demands (Q264310) (← links)
- Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities (Q301056) (← links)
- Hybrid search for the optimal PMU placement problem on a power grid (Q319263) (← links)
- Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
- A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
- Allocation strategies in hub networks (Q418055) (← links)
- Stochastic uncapacitated hub location (Q421562) (← links)
- A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
- Multi-period hub network design problems with modular capacities (Q512995) (← links)
- Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements (Q651672) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
- The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
- Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network (Q1639274) (← links)
- Routing and scheduling decisions in the hierarchical hub location problem (Q1652350) (← links)
- \(p\)-hub median problem for non-complete networks (Q1652628) (← links)
- A biased random-key genetic algorithm for the tree of hubs location problem (Q1676487) (← links)
- Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
- HUBBI: iterative network design for incomplete hub location problems (Q1725629) (← links)
- Median and covering location problems with interconnected facilities (Q1738812) (← links)
- Exact solution of hub network design problems with profits (Q1754057) (← links)
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths (Q1761222) (← links)
- A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Solving the optimum communication spanning tree problem (Q1991267) (← links)
- Proprietor and customer costs in the incomplete hub location-routing network topology (Q1991436) (← links)
- Less is more: general variable neighborhood search for the capacitated modular hub location problem (Q2002852) (← links)
- Alternate solution approaches for competitive hub location problems (Q2029306) (← links)
- Perspectives on modeling hub location problems (Q2029941) (← links)
- The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
- A two-level off-grid electric distribution problem on the continuous space (Q2147125) (← links)
- A non-triangular hub location problem (Q2191284) (← links)
- On carriers collaboration in hub location problems (Q2286966) (← links)
- Design of a reliable logistics network with hub disruption under uncertainty (Q2290904) (← links)
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
- Modeling congestion and service time in hub location problems (Q2295119) (← links)
- A bi-objective incomplete hub location-routing problem with flow shipment scheduling (Q2295274) (← links)
- A competitive hub location and pricing problem (Q2356192) (← links)
- Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
- Hub location problem considering spoke links with incentive-dependent capacities (Q2676359) (← links)
- Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q2980928) (← links)
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
- Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region (Q5085994) (← links)
- New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
