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 15 items.
- A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- Flow shipment scheduling in an incomplete hub location-routing network design problem (Q725702) (← links)
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution (Q727374) (← links)
- An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment (Q1631652) (← links)
- An endosymbiotic evolutionary algorithm for the hub location-routing problem (Q1665926) (← 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)
- Proprietor and customer costs in the incomplete hub location-routing network topology (Q1991436) (← links)
- Perspectives on modeling hub location problems (Q2029941) (← links)
- A bi-objective incomplete hub location-routing problem with flow shipment scheduling (Q2295274) (← links)
- Solving partitioning-hub location-routing problem using DCA (Q2358847) (← links)
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem (Q2672134) (← links)
- A fuzzy correlation based heuristic for dual-mode integrated location routing problem (Q2676327) (← links)
- A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)