Pages that link to "Item:Q2893920"
From MaRDI portal
The following pages link to Benders Decomposition for Large-Scale Uncapacitated Hub Location (Q2893920):
Displayed 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)
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty (Q322691) (← 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)
- Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
- Stochastic uncapacitated hub location (Q421562) (← links)
- A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
- An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem (Q1652441) (← links)
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← links)
- \(p\)-hub median problem for non-complete networks (Q1652628) (← links)
- Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
- Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment (Q1717038) (← links)
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems (Q1725627) (← links)
- A Benders decomposition approach for solving the offshore wind farm installation planning at the North Sea (Q1751693) (← links)
- The Benders decomposition algorithm: a literature review (Q1751891) (← links)
- A new cross decomposition method for stochastic mixed-integer linear programming (Q1752218) (← links)
- Service location grouping and pricing in transportation: application in air cargo (Q1754269) (← links)
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← 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)
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (Q1926700) (← links)
- Solving the optimum communication spanning tree problem (Q1991267) (← links)
- Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
- The hub location problem with market selection (Q2027000) (← links)
- Stochastic single-allocation hub location (Q2029287) (← links)
- Perspectives on modeling hub location problems (Q2029941) (← links)
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule (Q2030506) (← links)
- The hub location and pricing problem (Q2140288) (← links)
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
- Stochastic hub location problems with Bernoulli demands (Q2147142) (← links)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
- On carriers collaboration in hub location problems (Q2286966) (← links)
- Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse (Q2288987) (← links)
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
- Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs (Q2333123) (← links)
- Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment (Q2397582) (← links)
- A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system (Q2434331) (← links)
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty (Q2442082) (← links)
- The planar hub location problem: a probabilistic clustering approach (Q2449351) (← links)
- Dantzig-Wolfe decomposition for the facility location and production planning problem (Q2664417) (← links)
- Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
- Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem (Q2673530) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
- A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems (Q4685749) (← links)
- Stochastic Planning and Scheduling with Logic-Based Benders Decomposition (Q5057988) (← links)
- Single Allocation Hub Location with Heterogeneous Economies of Scale (Q5080641) (← links)
- The Star Degree Centrality Problem: A Decomposition Approach (Q5084632) (← links)