PTAS for the Euclidean capacitated vehicle routing problem in
M Khachay, R Dubinin - International Conference on Discrete …, 2016 - Springer
Abstract Capacitated Vehicle Routing Problem (CVRP) is the well-known combinatorial
optimization problem remaining NP-hard even in the Euclidean spaces of fixed dimension …
optimization problem remaining NP-hard even in the Euclidean spaces of fixed dimension …
Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand
M Khachay, Y Ogorodnikov - International Conference on Mathematical …, 2019 - Springer
Abstract The Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) is the
well-known combinatorial optimization problem having numerous valuable applications in …
well-known combinatorial optimization problem having numerous valuable applications in …
A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs
A Becker, PN Klein, D Saulpic - 25th Annual European …, 2017 - drops.dagstuhl.de
Abstract The Capacitated Vehicle Routing problem is a generalization of the Traveling
Salesman problem in which a set of clients must be visited by a collection of capacitated …
Salesman problem in which a set of clients must be visited by a collection of capacitated …
Efficient PTAS for the Euclidean CVRP with time windows
M Khachay, Y Ogorodnikov - … Conference on Analysis of Images, Social …, 2018 - Springer
Abstract The Capacitated Vehicle Routing Problem (CVRP) is the well-known combinatorial
optimization problem having a wide range of practical applications in operations research. It …
optimization problem having a wide range of practical applications in operations research. It …
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 …
optimization problem having numerous practically important applications. CVRP is strongly …
Improved polynomial time approximation scheme for capacitated vehicle routing problem with time windows
M Khachay, Y Ogorodnikov - International Conference on Optimization …, 2018 - Springer
Abstract The Capacitated Vehicle Routing Problem with Time Windows is the well-known
combinatorial optimization problem having numerous valuable applications in operations …
combinatorial optimization problem having numerous valuable applications in operations …
Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
MY Khachai, RD Dubinin - Proceedings of the Steklov Institute of …, 2017 - Springer
Abstract The Capacitated Vehicle Routing Problem (CVRP) is a classic combinatorial
optimization problem with a wide range of applications in operations research. Since the …
optimization problem with a wide range of applications in operations research. Since the …
Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows
MY Khachai, YY Ogorodnikov - Proceedings of the Steklov Institute of …, 2019 - Springer
The capacitated vehicle routing problem with time windows (CVRPTW) is a well-known NP-
hard combinatorial optimization problem. We present a further development of the approach …
hard combinatorial optimization problem. We present a further development of the approach …
Haimovich-Rinnooy Kan polynomial-time approximation scheme for the CVRP in metric spaces of a fixed doubling dimension
MY Khachai, YY Ogorodnikov - 2019 - elar.urfu.ru
The Capacitated Vehicle Routing Problem (CVRP) is a classical extremal combinatorial
routing problem with numerous applications in operations research. Although the CVRP is …
routing problem with numerous applications in operations research. Although the CVRP is …
Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
YY Ogorodnikov, MY Khachay - Computational Mathematics and …, 2021 - Springer
The capacitated vehicle routing problem (CVRP) is a classical combinatorial optimization
problem having a wide range of practically important applications in operations research. As …
problem having a wide range of practically important applications in operations research. As …