Vehicle Routing Approximation is an algorithmic framework within combinatorial optimization that specifically addresses the design of efficient approximation algorithms for variants of the Vehicle Routing Problem, distinguishing itself by providing provable guarantees on solution quality relative to optimal routes under constraints such as capacity, distance, or time windows.
98
Publications
13.7K
Citations
226
Authors
139
Institutions
Publications per year
2017–2026
33
Parents
Publications
98
Complexity of vehicle routing and scheduling problems
Jan Karel Lenstra, A. H. G. Rinnooy Kan · Networks · 1981 · 1.3K citations
Capacitated arc routing problems
Bruce Golden, Richard T. Wong · Networks · 1981 · 568 citations
1–5 of 98
Authors
226
- EU
4
h-index
- RB
4
h-index
- MG
4
h-index
- RR
3
h-index
- VN
3
h-index
1–5 of 226
Institutions
139
University of Bologna
Bologna, Italy
6 h-index
13 publications
3.5K citations
Universidade Federal Fluminense
Niterói, Brazil
5 h-index
9 publications
581 citations
Polytechnique Montréal
Montreal, Canada
5 h-index
7 publications
373 citations
University of Maryland, College Park
College Park, United States
4 h-index
5 publications
1.4K citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
4 publications
130 citations
University of Vienna
Vienna, Austria
3 h-index
3 publications
121 citations
Centre National de la Recherche Scientifique
Paris, France
3 h-index
5 publications
354 citations
Hong Kong Polytechnic University
Hong Kong, Hong Kong
3 h-index
5 publications
168 citations
1–8 of 139
Venues
- European Journal of Operational Research
15 publications · 1.7K citations
15
h-index
- Computers & Operations Research
10 publications · 802 citations
10
h-index
- Networks
6 publications · 2.3K citations
6
h-index
- Transportation Research Part E Logistics and Transportation Review
5 publications · 319 citations
5
h-index
- Mathematical Programming
3 publications · 782 citations
3
h-index
1–5