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

@@ Property / DOI @@
-.1016/j.cor.2015.06.005
@@ Property / DOI: 10.1016/j.cor.2015.06.005 / rank @@
-Normal rank
@@ 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
@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2015.06.005
+Normal rank
@@ Property / OpenAlex ID @@
+W569517619
@@ Property / OpenAlex ID: W569517619 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3989988
@@ Property / cites work: Q3989988 / rank @@
+Normal rank
@@ Property / cites work @@
+The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
+Normal rank
@@ Property / cites work @@
+Solving the quadratic minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+On The Boolean Quadric Forest Polytope
@@ Property / cites work: On The Boolean Quadric Forest Polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization with one quadratic term: spanning trees and forests
+Normal rank
@@ Property / cites work @@
+Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+An effective genetic algorithm approach to the quadratic minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
+Normal rank
@@ Property / cites work @@
+The Quadratic Assignment Problem
@@ Property / cites work: The Quadratic Assignment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Solution of the Quadratic Knapsack Problem
@@ Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Constrained 0-1 quadratic programming: basic approaches and extensions
+Normal rank
@@ Property / cites work @@
+A New Lower Bound for the Quadratic Assignment Problem
+Normal rank
@@ Property / cites work @@
+Q4321552
@@ Property / cites work: Q4321552 / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
+Normal rank
@@ Property / cites work @@
+A level-2 reformulation-linearization technique bound for the quadratic assignment problem
+Normal rank
@@ Property / cites work @@
+A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
+Normal rank
@@ Property / cites work @@
+A revised reformulation-linearization technique for the quadratic assignment problem
+Normal rank
@@ Property / cites work @@
+A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
+Normal rank
@@ Property / cites work @@
+Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2015.06.005
@@ Property / DOI: 10.1016/J.COR.2015.06.005 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:342082