A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing

被引：0

作者：

Das, Aparna

Mathieu, Claire

机构：

来源：

PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2010年 / 135卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In the capacitated vehicle routing problem, introduced by Dantzig and Ramsei in 1959, we are given the locations of a. customers and a depot, along with a vehicle of capacity k, and, wish to find a minimum length collection of toms, each starting nom the depot and visiting at most k customers, whose union covets all the customers We give a quasi-polynomial time approximation scheme for the setting where the customers and the depot are on the plane, and distances are given by the Euclidean metric

引用

页码：390 / 403

页数：14

共 50 条

[31] Improving the Approximation Ratio for Capacitated Vehicle Routing
Blauth, Jannis
Traub, Vera
Vygen, Jens
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2021, 2021, 12707 : 1 - 14
[32] The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time
Letchford, Adam N.
Salazar-Gonzalez, Juan-Jose
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 272 (01) : 24 - 31
[33] DECIDING PARITY GAMES IN QUASI-POLYNOMIAL TIME
Calude, Cristian S.
Jain, Sanjay
Khoussainov, Bakhadyr
Li, Wei
Stephan, Frank
SIAM JOURNAL ON COMPUTING, 2022, 51 (02)
[34] Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions
Vybiral, Jan
JOURNAL OF COMPLEXITY, 2014, 30 (02) : 48 - 55
[35] Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings
Rieger, Alon
Segev, Danny
MATHEMATICAL PROGRAMMING, 2024, 208 (1-2) : 111 - 171
[36] Towards an efficient approximability for the Euclidean Capacitated Vehicle Routing Problem with Time Windows and multiple depots
Khachay, Michael
Ogorodnikov, Yuri
IFAC PAPERSONLINE, 2019, 52 (13): : 2644 - 2649
[37] Quasi-polynomial Time Approximation of Output Probabilities of Geometrically-local, Shallow Quantum Circuits
Coble, Nolan J.
Coudron, Matthew
2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 598 - 609
[38] Polynomial-time approximation scheme for a Euclidean problem on a cycle covering of a graph
Khachai, M. Yu.
Neznakhina, E. D.
TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2014, 20 (04): : 297 - 311
[39] A polynomial time approximation scheme for Euclidean minimum cost k-connectivity
Czumaj, A
Lingas, A
AUTOMATA, LANGUAGES AND PROGRAMMING, 1998, 1443 : 682 - 694
[40] A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
M. Yu. Khachai
E. D. Neznakhina
Proceedings of the Steklov Institute of Mathematics, 2015, 289 : 111 - 125

← 1 2 3 4 5 →