A swarm intelligence approach to the quadratic minimum spanning tree problem

Sundar, Shyam; Singh, Alok

doi:10.1016/j.ins.2010.05.001

Cited by 102 publications

(33 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, only the inclusion of (2) is needed to obtain the complete RLT-1 reformulation. It was shown by Lee and Leung [17] that (5), (7), and (11) define facets of BQFP. In that study, it was also shown that the clique and the cut inequalities for BQP [16] also define facets for BQFP.…”

Section: Rlt-1 Based Boundsmentioning

confidence: 99%

Lower bounds and exact algorithms for the quadratic minimum spanning tree problem

Pereira

Gendreau

Cunha

2015

Computers & Operations Research

View full text Add to dashboard Cite

Section: Rlt-1 Based Boundsmentioning

confidence: 99%

Lower bounds and exact algorithms for the quadratic minimum spanning tree problem

Pereira

Gendreau

Cunha

2015

Computers & Operations Research

View full text Add to dashboard Cite

“…The frequently used MST searching algorithms are the Kruskal algorithm and the Prim algorithm [16][17][18]. Both of these two algorithms come from greedy ideas.…”

Section: Mst Searching Methodsmentioning

confidence: 99%

Building interior layout reconstruction from through-the-wall radar image using MST-based method

Chen

Jin

et al. 2014

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

In order to reconstruct the building interior layout from the through-the-wall radar image, this paper proposes a method based on minimum spanning tree (MST) which comes from the graph theory. The building layout graph (BLG) model is firstly established using the wall-wall-floor trihedrals inside the building. The vertex set and the edge set including the weight between any two nodes of the graph are defined afterwards. Then, the MST-based method is used to reconstruct the building interior layout. We have also improved the traditional method by applying the MST model with restricted conditions to solve the reconstruction problem when there exist interference targets in a building. The anechoic chamber measurements are carried out to demonstrate the suitability and efficacy of the MST-based method.

show abstract

“…Pereira et al [7] proposed some new formulations using a particular partitioning of the spanning trees, and provided a new mixed binary formulation for the problem by applying the first level of the reformulation-linearization technique (RLT). The most effective heuristic approaches for the QMSTP can be found in [2,[8][9][10].…”

Section: Introductionmentioning

confidence: 99%

Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation

Rostami

Malucelli

2015

Computers & Operations Research

View full text Add to dashboard Cite

A swarm intelligence approach to the quadratic minimum spanning tree problem

Cited by 102 publications

References 12 publications

Lower bounds and exact algorithms for the quadratic minimum spanning tree problem

Lower bounds and exact algorithms for the quadratic minimum spanning tree problem

Building interior layout reconstruction from through-the-wall radar image using MST-based method

Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation

Contact Info

Product

Resources

About