A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem (Q2267269): Difference between revisions

@@ 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/s10255-008-8811-5
+Normal rank
@@ Property / OpenAlex ID @@
+W1982197415
@@ Property / OpenAlex ID: W1982197415 / rank @@
+Normal rank
@@ Property / cites work @@
+Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
+Normal rank
@@ Property / cites work @@
+Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
+Normal rank
@@ Property / cites work @@
+The vehicle routing problem. Latest advances and new challenges.
+Normal rank
@@ Property / cites work @@
+Q3640530
@@ Property / cites work: Q3640530 / rank @@
+Normal rank
@@ Property / cites work @@
+A general heuristic for vehicle routing problems
@@ Property / cites work: A general heuristic for vehicle routing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2267269