A feasibility pump and a local branching heuristics for the weight-constrained minimum spanning tree problem

The Weight-constrained Minimum Spanning Tree problem (WMST) is a combinatorial optimization problem aiming to find a spanning tree of minimum cost with total edge weight not exceeding a given specified limit. This problem has important applications in the telecommunications network design and commun...

Full description

Bibliographic Details
Main Author: Requejo, Cristina (author)
Other Authors: Santos, Eulália (author)
Format: bookPart
Language:eng
Published: 2017
Subjects:
Weighted MST
Minimum spanning tree
Feasibility Pump
Heuristics
Local Branching
Online Access:http://hdl.handle.net/10773/18420
Country:Portugal
Oai:oai:ria.ua.pt:10773/18420

Internet

http://hdl.handle.net/10773/18420

Similar Items