The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
From MaRDI portal
Recommendations
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- scientific article; zbMATH DE number 35513
- Solving the quadratic minimum spanning tree problem
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
Cites work
- An effective genetic algorithm approach to the quadratic minimum spanning tree problem
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- Fuzzy quadratic minimum spanning tree problem
- scientific article; zbMATH DE number 35513 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- Linear multiplicative programming
- On linear multiplicative programming.
- On the quadratic assignment problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- QAPLIB - a quadratic assignment problem library
- Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
- The quadratic assignment problem
- Variable neighborhood search: Principles and applications
Cited in
(22)- The quadratic minimum spanning tree problem and its variations
- A characterization of linearizable instances of the quadratic minimum spanning tree problem
- The quadratic shortest path problem: complexity, approximability, and solution methods
- Matroid optimization problems with monotone monomials in the objective
- Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
- Complete description for the spanning tree problem with one linearised quadratic term
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- 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
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
- Solving the quadratic minimum spanning tree problem
- scientific article; zbMATH DE number 35513 (Why is no real title available?)
- Combinatorial optimization with one quadratic term: spanning trees and forests
- The minimum spanning tree problem with conflict constraints and its variations
- Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
- Concentration inequalities for nonlinear matroid intersection
- Quadratic bottleneck problems
- Concentration inequalities for nonlinear matroid intersection
- The quadratic minimum spanning tree problem: lower bounds via extended formulations
- Spanning and splitting: integer semidefinite programming for the quadratic minimum spanning tree problem
- RiNNAL+: a Riemannian ALM solver for SDP-RLT relaxations of mixed-binary quadratic programs
This page was built for publication: The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976040)
