An inexact algorithm for the sequential ordering problem (Q1108187): Difference between revisions

@@ Property / cites work @@
+A restricted Lagrangean approach to the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+An inexact algorithm for the sequential ordering problem
+Normal rank
@@ Property / cites work @@
+A Cutting Plane Algorithm for the Linear Ordering Problem
+Normal rank
@@ Property / cites work @@
+Facets of the linear ordering polytope
@@ Property / cites work: Facets of the linear ordering polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Local Search for the Asymmetric Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q3707785
@@ Property / cites work: Q3707785 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4194705
@@ Property / cites work: Q4194705 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph
+Normal rank