Pages that link to "Item:Q408393"
From MaRDI portal
The following pages link to A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion (Q408393):
Displaying 25 items.
- Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty (Q322691) (← links)
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks (Q323507) (← links)
- Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
- Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion (Q1639271) (← links)
- A branch-and-check approach for a wind turbine maintenance scheduling problem (Q1651530) (← links)
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
- Incremental optimization of hub and spoke network for the spokes' numbers and flow (Q1666325) (← links)
- Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment (Q1717038) (← links)
- The Benders decomposition algorithm: a literature review (Q1751891) (← links)
- Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
- Perspectives on modeling hub location problems (Q2029941) (← links)
- The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion (Q2052283) (← 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)
- Modeling congestion and service time in hub location problems (Q2295119) (← links)
- Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment (Q2397582) (← links)
- Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
- Skyport location problem for urban air mobility system (Q2669717) (← links)
- Benders Decomposition for Production Routing Under Demand Uncertainty (Q3465587) (← links)
- Multiple allocation hub location with service level constraints for two shipment classes (Q6112611) (← links)
- A new formulation and branch-and-cut method for single-allocation hub location problems (Q6164619) (← links)
- Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs (Q6551136) (← links)
- Hub location with congestion and time-sensitive demand (Q6565427) (← links)
