Efficient approximation of the metric CVRP in spaces of fixed doubling dimension

The capacitated vehicle routing problem (CVRP) is the well-known combinatorial optimization problem having numerous practically important applications. CVRP is strongly NP-hard (even on the Euclidean plane), hard to approximate in general case and APX-complete for an arbitrary metric. Meanwhile, for...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of global optimization 2021-07, Vol.80 (3), p.679-710
Hauptverfasser:	Khachay, Michael, Ogorodnikov, Yuri, Khachay, Daniel
Format:	Artikel
Sprache:	eng
Schlagworte:	Approximation Combinatorial analysis Computer Science Euclidean geometry Mathematical analysis Mathematics Mathematics and Statistics Metric space Operations Research/Decision Theory Optimization Polynomials Real Functions Route planning Vehicle routing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!