Solving the quadratic minimum spanning tree problem

DOI10.1016/j.amc.2012.05.043zbMath1278.05071OpenAlexW2079583273MaRDI QIDQ387698

Gianluca Passeri, Roberto Cordone

Publication date: 23 December 2013

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.05.043

zbMATH Keywords

tabu searchbranch-and-boundbinary quadratic programmingvariable neighbourhood searchquadratic minimum spanning tree problem

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Combinatorial optimization (90C27)

Related Items (11)

Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints ⋮ Lower bounds and exact algorithms for the quadratic minimum spanning tree problem ⋮ Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation ⋮ The quadratic minimum spanning tree problem and its variations ⋮ Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem ⋮ Combinatorial optimization with one quadratic term: spanning trees and forests ⋮ A characterization of linearizable instances of the quadratic minimum spanning tree problem ⋮ Complete description for the spanning tree problem with one linearised quadratic term ⋮ Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem ⋮ Matroid optimization problems with monotone monomials in the objective ⋮ Unnamed Item

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fuzzy quadratic minimum spanning tree problem
• An exact algorithm for the node weighted Steiner tree problem
• Tabu search versus GRASP for the maximum diversity problem
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
• An effective genetic algorithm approach to the quadratic minimum spanning tree problem
• A tabu search heuristic for the Steiner Tree Problem
• Variable Neighborhood Search
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
• Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints

This page was built for publication: Solving the quadratic minimum spanning tree problem