Survey of Approximation Schemes for Capacity Vehicle Routing Problems
A new survey shows CVRP remains NP‑hard for capacity ≥3 and APX‑hard, with recent quasi‑polynomial‑time approximation schemes for Euclidean cases but no PTAS yet. Read more: getnews.me/survey-of-approximation-... #cvrp #approximation #logistics