Pages that link to "Item:Q5391891"
From MaRDI portal
The following pages link to A Benders Decomposition for Hub Location Problems Arising in Public Transport (Q5391891):
Displaying 13 items.
- 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)
- Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
- The tree of hubs location problem (Q1039782) (← links)
- A biased random-key genetic algorithm for the tree of hubs location problem (Q1676487) (← links)
- Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
- Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment (Q1717038) (← 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)
- Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
- Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment (Q2397582) (← links)
- A capacitated hub location problem in freight logistics multimodal networks (Q2629899) (← links)
- Multi-period hub location problem considering polynomial time-dependent demand (Q6047917) (← links)