The following pages link to (Q3147668):
Displaying 50 items.
- Hub location problems with price sensitive demands (Q264310) (← links)
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities (Q301056) (← links)
- Hub location under competition (Q322435) (← links)
- A Stackelberg hub arc location model for a competitive environment (Q337007) (← links)
- A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion (Q408393) (← links)
- Allocation strategies in hub networks (Q418055) (← links)
- Stochastic uncapacitated hub location (Q421562) (← links)
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem (Q526415) (← links)
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421) (← links)
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements (Q651672) (← links)
- A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
- Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
- Single-allocation ordered median hub location problems (Q709204) (← links)
- New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← links)
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521) (← links)
- Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
- Hub location for time definite transportation (Q833526) (← links)
- A conditional \(p\)-hub location problem with attraction functions (Q833528) (← links)
- Aggregation in hub location problems (Q833529) (← links)
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem (Q833530) (← links)
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem (Q833533) (← links)
- The stochastic \(p\)-hub center problem with service-level constraints (Q833535) (← links)
- An exact solution procedure for a cluster hub location problem (Q859914) (← links)
- Locating landfills--optimization vs. reality (Q864021) (← links)
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem (Q879279) (← links)
- Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
- Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
- Location with acceleration-deceleration distance (Q1027601) (← links)
- Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
- The tree of hubs location problem (Q1039782) (← links)
- Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
- A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
- Routing and scheduling decisions in the hierarchical hub location problem (Q1652350) (← links)
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem (Q1652441) (← links)
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- An improved algorithm for fixed-hub single allocation problems (Q1697895) (← links)
- Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems (Q1725627) (← links)
- An intermodal hub location problem for container distribution in Indonesia (Q1725631) (← links)
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations (Q1733092) (← links)
- Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty (Q1752865) (← links)
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths (Q1761222) (← links)
- Hub-and-spoke network design with congestion (Q1764770) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Location analysis: a synthesis and survey (Q1776950) (← links)
- Threshold based discounting networks: the cost allocation provided by the nucleolus (Q1779541) (← links)
- A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
- Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm (Q1792363) (← links)
- A cost allocation problem arising in hub-spoke network systems (Q1885769) (← links)
