Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem

The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm

Networks ◽

10.1002/net.10105 ◽

2004 ◽

Vol 43 (2) ◽

pp. 71-86 ◽

Cited By ~ 22

Author(s):

Corinne Feremans ◽

Martine Labbé ◽

Gilbert Laporte

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree ◽

Branch And Cut ◽

Polyhedral Analysis ◽

Generalized Minimum Spanning Tree

A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72845-0_29 ◽

2007 ◽

pp. 379-392 ◽

Cited By ~ 3

Author(s):

Markus Behle ◽

Michael Jünger ◽

Frauke Liers

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree ◽

Branch And Cut ◽

Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem

Networks ◽

10.1002/net.21787 ◽

2017 ◽

Vol 71 (1) ◽

pp. 31-50 ◽

Cited By ~ 3

Author(s):

Dilson Lucas Pereira ◽

Alexandre Salles da Cunha

Keyword(s):

Lagrangian Relaxation ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Branch And Cut ◽

Relaxation Algorithms ◽

Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem

Computational Optimization and Applications ◽

10.1007/s10589-015-9788-7 ◽

2015 ◽

Vol 63 (3) ◽

pp. 755-792 ◽

Cited By ~ 5

Author(s):

Luis Henrique Bicalho ◽

Alexandre Salles da Cunha ◽

Abilio Lucena

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree ◽

Branch And Cut ◽

The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm

Discrete Applied Mathematics ◽

10.1016/j.dam.2011.08.008 ◽

2014 ◽

Vol 164 ◽

pp. 210-224 ◽

Cited By ~ 10

Author(s):

Leonardo Conegundes Martinez ◽

Alexandre Salles da Cunha

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree ◽

Branch And Cut ◽

Problem Formulations

A branch and cut method for the degree-constrained minimum spanning tree problem

Networks ◽

10.1002/1097-0037(200103)37:2<74::aid-net2>3.0.co;2-e ◽

2001 ◽

Vol 37 (2) ◽

pp. 74-83 ◽

Cited By ~ 24

Author(s):

L. Caccetta ◽

S.P. Hill

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree ◽

Branch And Cut ◽

Cut Method ◽

Branch And Cut Method

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem

Networks ◽

10.1002/net.20485 ◽

2011 ◽

Vol 59 (1) ◽

pp. 148-160 ◽

Cited By ~ 5

Author(s):

Eduardo Uchoa ◽

Túlio A. M. Toffolo ◽

Mauricio C. de Souza ◽

Alexandre X. Martins ◽

Ricardo Fukasawa

Keyword(s):

Local Search ◽

Spanning Tree ◽

Minimum Spanning Tree ◽

Branch And Cut ◽

Capacitated Minimum Spanning Tree ◽

Multi Level ◽

Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem

Networks ◽

10.1002/net.21580 ◽

2015 ◽

Vol 65 (4) ◽

pp. 367-379 ◽

Cited By ~ 7

Author(s):

Dilson Lucas Pereira ◽

Michel Gendreau ◽

Alexandre Salles da Cunha

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree ◽

Branch And Cut ◽

Penalty Strategy in The Fitness Function of Grey Wolf Optimizer for Minimum Spanning Tree Problem

IOP Conference Series Materials Science and Engineering ◽

10.1088/1757-899x/1077/1/012071 ◽

2021 ◽

Vol 1077 (1) ◽

pp. 012071

Author(s):

Z Zukhri ◽

I V Paputungan ◽

N S Handayani ◽

V Satriadi

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree ◽

Fitness Function ◽

Grey Wolf Optimizer ◽

Grey Wolf ◽

Penalty Strategy

Fuzzy quadratic minimum spanning tree problem

Applied Mathematics and Computation ◽

10.1016/j.amc.2004.06.051 ◽

2005 ◽

Vol 164 (3) ◽

pp. 773-788 ◽

Cited By ~ 22

Author(s):

Jinwu Gao ◽

Mei Lu

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree ◽