Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 90C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 90C10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6636414
@@ Property / zbMATH DE Number: 6636414 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+traveling salesman
@@ Property / zbMATH Keywords: traveling salesman / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+reformulation-linearization technique
@@ Property / zbMATH Keywords: reformulation-linearization technique / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+cycle cover
@@ Property / zbMATH Keywords: cycle cover / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+column generation
@@ Property / zbMATH Keywords: column generation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lower bound
@@ Property / zbMATH Keywords: lower bound / rank @@
+Normal rank

Revision as of 03:24, 28 June 2023