Approximation algorithms for some vehicle routing problems (Q1765372): Difference between revisions

@@ Property / author @@
-Jérôme Monnot
@@ Property / author: Jérôme Monnot / rank @@
-Normal rank
@@ Property / author @@
+Jérôme Monnot
@@ Property / author: Jérôme Monnot / 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.1016/j.dam.2004.07.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2063605597
@@ Property / OpenAlex ID: W2063605597 / rank @@
+Normal rank
@@ Property / cites work @@
+Structure preserving reductions among convex optimization problems
+Normal rank
@@ Property / cites work @@
+Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4371290
@@ Property / cites work: Q4371290 / rank @@
+Normal rank
@@ Property / cites work @@
+On an approximation measure founded on the links between optimization and polynomial approximation theory
+Normal rank
@@ Property / cites work @@
+Q4526990
@@ Property / cites work: Q4526990 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535019
@@ Property / cites work: Q4535019 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds and Heuristics for Capacitated Routing Problems
+Normal rank
@@ Property / cites work @@
+Q3799801
@@ Property / cites work: Q3799801 / rank @@
+Normal rank
@@ Property / cites work @@
+z-Approximations
@@ Property / cites work: z-Approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing the number of unused colors in the vertex coloring problem
+Normal rank
@@ Property / cites work @@
+Better approximations for max TSP
@@ Property / cites work: Better approximations for max TSP / rank @@
+Normal rank
@@ Property / cites work @@
+On the completeness of a generalized matching problem
+Normal rank
@@ Property / cites work @@
+On the Distance Constrained Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+Differential approximation results for the traveling salesman and related problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
+Normal rank
@@ Property / cites work @@
+Q4782716
@@ Property / cites work: Q4782716 / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of the traveling salesman problem (extended abstract)
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank
@@ Property / cites work @@
+A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1765372