An integer programming approach for the time-dependent TSP (Q2883581): Difference between revisions

@@ Property / DOI @@
-.1016/j.endm.2010.05.045
@@ Property / DOI: 10.1016/j.endm.2010.05.045 / rank @@
-Normal rank
@@ Property / cites work @@
+Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+On the dimension of projected polyhedra
@@ Property / cites work: On the dimension of projected polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
+Normal rank
@@ Property / cites work @@
+Technical Note—An <i>n</i>-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+A classification of formulations for the (time-dependent) traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A new formulation for the traveling deliveryman problem
+Normal rank
@@ Property / cites work @@
+The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
+Normal rank
@@ Property / cites work @@
+Scheduling in a sequence dependent setup environment with genetic search
+Normal rank
@@ Property / cites work @@
+Q4715981
@@ Property / cites work: Q4715981 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ENDM.2010.05.045
@@ Property / DOI: 10.1016/J.ENDM.2010.05.045 / rank @@
+Normal rank