Pages that link to "Item:Q2935299"
From MaRDI portal
The following pages link to Hub Location as the Minimization of a Supermodular Set Function (Q2935299):
Displaying 16 items.
- Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
- Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
- An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
- Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
- Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem (Q1725626) (← links)
- A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
- Exact solution of hub network design problems with profits (Q1754057) (← links)
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem (Q1754726) (← links)
- A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method (Q1985069) (← links)
- Perspectives on modeling hub location problems (Q2029941) (← links)
- The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
- An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location (Q5131704) (← links)
- A branch‐and‐cut algorithm for hub network design problems with profits (Q6051584) (← links)
