Pages that link to "Item:Q3505942"
From MaRDI portal
The following pages link to The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic (Q3505942):
Displaying 19 items.
- Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
- Multimodal freight transportation planning: a literature review (Q297170) (← links)
- Models and algorithms for network reduction (Q320811) (← links)
- A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
- Allocation strategies in hub networks (Q418055) (← links)
- Successive smoothing algorithm for solving large-scale optimization models with fixed cost (Q492827) (← links)
- Multi-period hub network design problems with modular capacities (Q512995) (← links)
- Flow shipment scheduling in an incomplete hub location-routing network design problem (Q725702) (← links)
- A conditional \(p\)-hub location problem with attraction functions (Q833528) (← links)
- An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
- Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
- Branch-and-price-and-cut for a service network design and hub location problem (Q1752143) (← links)
- Proprietor and customer costs in the incomplete hub location-routing network topology (Q1991436) (← links)
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
- A non-triangular hub location problem (Q2191284) (← links)
- A bi-objective incomplete hub location-routing problem with flow shipment scheduling (Q2295274) (← links)
- Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
- Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation (Q6106564) (← links)