Integer linear programming formulations of multiple salesman problems and its variations (Q2503218): Difference between revisions

@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+Normal rank
@@ Property / cites work @@
+Note—A Note on “The Formulation of the <i>M</i>-Salesman Traveling Salesman Problem”
+Normal rank
@@ Property / cites work @@
+An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
+Normal rank
@@ Property / cites work @@
+Implementing vehicle routing algorithms
@@ Property / cites work: Implementing vehicle routing algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Cutting Planes Algorithm for the m-Salesmen Problem
+Normal rank
@@ Property / cites work @@
+Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave
+Normal rank
@@ Property / cites work @@
+Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
+Normal rank
@@ Property / cites work @@
+Some Simple Applications of the Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Computational Experience with an <i>M</i>-Salesman Traveling Salesman Algorithm
+Normal rank
@@ Property / cites work @@
+A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
+Normal rank
@@ Property / cites work @@
+Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
+Normal rank