Pages that link to "Item:Q709201"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201):
Displayed 6 items.
- A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution (Q727374) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Solving partitioning-hub location-routing problem using DCA (Q2358847) (← links)
- A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)