scientific article; zbMATH DE number 6297716
From MaRDI portal
Publication:5417633
zbMath1288.90073MaRDI QIDQ5417633
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (9)
Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem ⋮ Approximation schemes for Euclidean vehicle routing problems with time windows ⋮ A PTAS for the geometric connected facility location problem ⋮ A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW ⋮ Minimizing the maximum flow time in the online food delivery problem ⋮ Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees ⋮ A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing ⋮ Capacitated Vehicle Routing with Non-uniform Speeds ⋮ Capacitated Vehicle Routing with Nonuniform Speeds
This page was built for publication:
