A LP-based heuristic for a time-constrained routing problem (Q2491773): 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.1016/j.ejor.2004.09.055
+Normal rank
@@ Property / OpenAlex ID @@
+W2018902895
@@ Property / OpenAlex ID: W2018902895 / rank @@
+Normal rank
@@ Property / cites work @@
+A set‐partitioning‐based exact algorithm for the vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
+Normal rank
@@ Property / cites work @@
+Conflict graphs in solving integer programming problems
+Normal rank
@@ Property / cites work @@
+Solving a fuel delivery problem by heuristic and exact approaches.
+Normal rank
@@ Property / cites work @@
+On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Q5687193
@@ Property / cites work: Q5687193 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Airline Crew Scheduling Problems by Branch-and-Cut
+Normal rank
@@ Property / cites work @@
+A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+The Vehicle Routing Problem
@@ Property / cites work: The Vehicle Routing Problem / rank @@
+Normal rank