Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6654048
@@ Property / zbMATH DE Number: 6654048 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+quadratic minimum spanning tree problem
@@ Property / zbMATH Keywords: quadratic minimum spanning tree problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Lagrangian relaxation
@@ Property / zbMATH Keywords: Lagrangian relaxation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+reformulation-linearization technique
@@ Property / zbMATH Keywords: reformulation-linearization technique / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lower bound
@@ Property / zbMATH Keywords: lower bound / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dual-ascent approach
@@ Property / zbMATH Keywords: dual-ascent approach / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+reduced costs
@@ Property / zbMATH Keywords: reduced costs / rank @@
+Normal rank

Revision as of 06:25, 28 June 2023