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

Networks ◽  
2017 ◽  
Vol 71 (1) ◽  
pp. 31-50 ◽  
Author(s):  
Dilson Lucas Pereira ◽  
Alexandre Salles da Cunha
Keyword(s):  
Lagrangian Relaxation ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Branch And Cut ◽  
Relaxation Algorithms ◽  
Minimum Spanning Tree Problem

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

Networks ◽  
2011 ◽  
Vol 59 (1) ◽  
pp. 148-160 ◽  
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 ◽  
Minimum Spanning Tree Problem

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

Networks ◽  
2015 ◽  
Vol 65 (4) ◽  
pp. 367-379 ◽  
Author(s):  
Dilson Lucas Pereira ◽  
Michel Gendreau ◽  
Alexandre Salles da Cunha
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Branch And Cut ◽  
Minimum Spanning Tree Problem
Sign in / Sign up

Export Citation Format

Share Document