In this paper we present a new formulation for the Capacitated Minimal Spanning Tree
(CMST) problem. One advantage of the new formulation is that it is more compact (in the …

In integer programming and combinatorial optimisation, people use the term matheuristics to
refer to methods that are heuristic in nature but draw on concepts from the literature on exact …

This paper focuses on the capacitated minimum spanning tree (CMST) problem. Given a
central processor and a set of remote terminals with specified demands for traffic that must …

Given an undirected graph G=(V, E) with nonnegative costs on its edges, a root node r V, a
set of demands DV with demand v D wishing to route w (v) units of flow (weight) to r, and a …

The capacitated minimum spanning tree (CMST) problem is a fundamental problem in
telecommunication network design. Given a central node and a set of remote terminal nodes …

In this paper we propose a hybrid memory adaptive heuristic for solving the Capacitated
Minimum Spanning Tree (CMST) problem. We augment the problem formulation with …

This paper develops a greedy heuristic for the capacitated minimum spanning tree problem
(CMSTP), based on the two widely known methods of Prim and of Esau–Williams. The …

In this paper, we compare linear integer programming directed formulations for the
capacitated minimal spanning tree (CMST) problem. This problem is directly related to …

Abstract The Capacitated Minimal Spanning Tree Problem (CMSTP) is to find a minimal
spanningtree with an additional cardinality constraint on the size of the subtrees off of a …

In this paper, we examine a multi-period capacity expansion problem for a local access
telecommunications network with a tree topology. Capacity expansion is realized through …