Finding optimal tour schedules on transportation paths under extended time window constraints (Q341462): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M20
@@ Property / Mathematics Subject Classification ID: 68M20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C39
@@ Property / Mathematics Subject Classification ID: 90C39 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B06
@@ Property / Mathematics Subject Classification ID: 90B06 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6653502
@@ Property / zbMATH DE Number: 6653502 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+optimal tours on given transportation paths
@@ Property / zbMATH Keywords: optimal tours on given transportation paths / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+extended release date restrictions
@@ Property / zbMATH Keywords: extended release date restrictions / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+line-TRP with extended time windows
@@ Property / zbMATH Keywords: line-TRP with extended time windows / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+complexity analysis
@@ Property / zbMATH Keywords: complexity analysis / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+branch-and-bound
@@ Property / zbMATH Keywords: branch-and-bound / rank @@
+Normal rank

Revision as of 07:16, 28 June 2023