Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718): Difference between revisions

Latest revision as of 13:40, 9 July 2024

scientific article

Language	Label	Description	Also known as
English	Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees	scientific article

Statements

instance of

scholarly article

0 references

title

Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (English)

0 references

0 references

0 references

Journal of Combinatorial Optimization

0 references

publication date

21 January 2015

0 references

zbMATH Keywords

traveling salesman

0 references

vehicle routing

0 references

local search

0 references

approximation algorithms

0 references

describes a project that uses

VRP

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10878-012-9580-x

0 references

cites work

Q4421940

0 references

PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k

0 references

New local search approximation techniques for maximum generalized satisfiability problems

0 references

A Survey of Approximation Results for Local Search Algorithms

0 references

Approximate Local Search in Combinatorial Optimization

0 references

Q5417633

0 references

Fast local search algorithms for the handicapped persons transportation problem

0 references

Q4339078

0 references

The vehicle routing problem. Latest advances and new challenges.

0 references

The traveling salesman problem and its variations.

0 references

On Syntactic versus Computational Views of Approximability

0 references

Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems

0 references

An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem

0 references

Theoretical aspects of local search.

0 references

\(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem

0 references

An Analysis of Several Heuristics for the Traveling Salesman Problem

0 references

Q4955264

0 references

Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation

0 references

The Design of Approximation Algorithms

0 references

An analysis of the extended Christofides heuristic for the \(k\)-depot TSP

0 references

Identifiers

zbMATH Open document ID

1335.90107

0 references

DOI

10.1007/s10878-012-9580-x

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:489718

@@ Property / describes a project that uses @@
+VRP
@@ Property / describes a project that uses: VRP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-012-9580-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2005363060
@@ Property / OpenAlex ID: W2005363060 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4421940
@@ Property / cites work: Q4421940 / rank @@
+Normal rank
@@ Property / cites work @@
+PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k
+Normal rank
@@ Property / cites work @@
+New local search approximation techniques for maximum generalized satisfiability problems
+Normal rank
@@ Property / cites work @@
+A Survey of Approximation Results for Local Search Algorithms
+Normal rank
@@ Property / cites work @@
+Approximate Local Search in Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Q5417633
@@ Property / cites work: Q5417633 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast local search algorithms for the handicapped persons transportation problem
+Normal rank
@@ Property / cites work @@
+Q4339078
@@ Property / cites work: Q4339078 / rank @@
+Normal rank
@@ Property / cites work @@
+The vehicle routing problem. Latest advances and new challenges.
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations.
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Theoretical aspects of local search.
@@ Property / cites work: Theoretical aspects of local search. / rank @@
+Normal rank
@@ Property / cites work @@
+\(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
+Normal rank
@@ Property / cites work @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4955264
@@ Property / cites work: Q4955264 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
+Normal rank