Solving the quadratic minimum spanning tree problem

DOI10.1016/J.AMC.2012.05.043zbMATH Open1278.05071OpenAlexW2079583273MaRDI QIDQ387698FDOQ387698

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

Recommendations

• scientific article; zbMATH DE number 35513
• The quadratic minimum spanning tree problem and its variations
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
• Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
• Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
• Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
• Fuzzy quadratic minimum spanning tree problem
• A characterization of linearizable instances of the quadratic minimum spanning tree problem
• On a quadratic programming problem involving distances in trees
• On solving the quadratic shortest path problem

zbMATH Keywords

tabu searchbinary quadratic programmingbranch-and-boundvariable neighbourhood searchquadratic minimum spanning tree problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (15)

• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
• A characterization of linearizable instances of the quadratic minimum spanning tree problem
• 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
• Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
• Combinatorial optimization with one quadratic term: spanning trees and forests
• Title not available (Why is that?)
• Title not available (Why is that?)
• On a quadratic programming problem involving distances in trees
• Complete description for the spanning tree problem with one linearised quadratic term
• Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
• Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem
• Tabu Search Algorithm Based on Strategic Oscillation for Nonlinear Minimum Spanning Tree Problems
• The quadratic minimum spanning tree problem and its variations
• Fuzzy quadratic minimum spanning tree problem

Uses Software

• Tabu search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387698)