Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation
Review and analyzing different lower bounding strategies for the QMSTP. Using the meaning of reduced costs to develop new bounds. Developing two new bounds based on a reformulation scheme. Developing a new bound based on a second level of the RLT. Devising some efficient dual-ascent algorithms to solve the proposed models.
lower bound quadratic minimum spanning tree problem reduced costs lagrangian relaxation reformulationlinearization technique dual-ascent approach