Pages that link to "Item:Q1622797"
From MaRDI portal
The following pages link to Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797):
Displaying 6 items.
- Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations (Q2669602) (← links)
- A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics (Q2678624) (← links)
- Transformations of node‐balanced routing problems (Q4632892) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- A flow-based model for the multivehicle covering tour problem with route balancing (Q6495377) (← links)