On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167): Difference between revisions

@@ Property / cites work @@
+Constraint-based scheduling: Applying constraint programming to scheduling problems.
+Normal rank
@@ Property / cites work @@
+Constraint logic programming for examination timetabling
+Normal rank
@@ Property / cites work @@
+A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Q5687193
@@ Property / cites work: Q5687193 / rank @@
+Normal rank
@@ Property / cites work @@
+The split delivery vehicle scheduling problem with time windows and grid network distances
+Normal rank
@@ Property / cites work @@
+A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
+Normal rank
@@ Property / cites work @@
+A computational study of constraint satisfaction for multiple capacitated job shop scheduling
+Normal rank
@@ Property / cites work @@
+An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Probabilistic diversification and intensification in local search for vehicle routing
+Normal rank
@@ Property / cites work @@
+Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
+Normal rank
@@ Property / cites work @@
+A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(98)00248-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2037615545
@@ Property / OpenAlex ID: W2037615545 / rank @@
+Normal rank