It is the purpose of this paper to investigate effects of adding randomization to a memory-based heuristic. The algorithms we propose are applied to the Capacitated Minimum Spanning Tree problem (CMST), and we study the combined effects of simultaneously applying a memory-based and a...

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...

Presents an approach for evaluating the number of vendors to employ in a procurement situation using multi‐objective programming (MOP) and data envelopment analysis (DEA). The approach advocates developing vendor‐order quantity solutions (referred to as supervendors) using MOP and then...

Purpose: This study aims to examine the factors influencing enterprise risk management and propose a framework for identifying and explaining the components of enterprise risk management. To enable broader analytical thinking about risk factors, the framework utilizes the resource-based theory...