Pages that link to "Item:Q2384615"
From MaRDI portal
The following pages link to Solving a capacitated hub location problem (Q2384615):
Displaying 26 items.
- Multimodal freight transportation planning: a literature review (Q297170) (← links)
- Single-allocation ordered median hub location problems (Q709204) (← links)
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution (Q727374) (← links)
- Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
- A conditional \(p\)-hub location problem with attraction functions (Q833528) (← links)
- Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
- Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
- A linear program for the two-hub location problem (Q1278146) (← links)
- Solution algorithms for the capacitated single allocation hub location problem (Q1290137) (← links)
- Solution approaches to hub location problems (Q1385332) (← links)
- The hub location and routing problem (Q1388939) (← links)
- The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
- A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
- Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion (Q2241568) (← links)
- An improved Benders decomposition algorithm for the tree of hubs location problem (Q2253556) (← links)
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
- Formulating and solving splittable capacitated multiple allocation hub location problems (Q2387295) (← links)
- Solving the hub location problem with modular link capacities (Q2387305) (← links)
- Solution of preemptive multi-objective network design problems applying Benders decomposition method (Q2442088) (← links)
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← links)
- Branch and price for large-scale capacitated hub location problems with single assignment (Q2899101) (← links)
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic (Q3505942) (← links)
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study (Q5242266) (← links)
- An efficient model for the multiple allocation hub maximal covering problem (Q6078427) (← links)