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 additional non-redundant constraints via use of adaptive memory, to improve upon the performance of an elementary heuristic (the...

In this article, the authors present a conceptual framework named 'Adaptive Seriational Risk Parity' (ASRP) to extend Hierarchical Risk Parity (HRP) as an asset allocation heuristic. The first step of HRP (quasi-diagonalization) determining the hierarchy of assets is required for the actual...

This paper presents two heuristic algorithms for the distance-based critical node problem (DCNP) that finds k nodes whose removalminimizes the pairwise connection within D hops in the remaining network. The structural properties of complex networks havenot yet been extensively addressed in the...