We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of nodes on the source side, subject to the constraint that its capacity not exceed a prescribed bound B. Besides being of interest in the study of graph cuts, this problem arises in many practical settings, such as in epidemi...

The new concept of an unbalanced, hierarchicallydivided cache memory system is introduced and analyzed. This approach generalizes existing cache structures by allowing different memory references (e.g. as possibly unevenly divided within an address-space) to be subject to various levels of caching as well as varied amounts of cache at each level. Under the assumption that the total cache size a...

Most group decision making (GDM) problems based on linguistic approaches use symmetrically and uniformly distributed linguistic term sets to express experts’ opinions. However, there exist problems whose assessments need to be represented by means of unbalanced linguistic term sets, i.e. using term sets that are not uniformly and symmetrically distributed. The aim of this paper is to present a ...

Though, in the literature, many heuristic approaches were developed in getting an initial solution, VAM (Vogel’s approximation method) is considered to be a better efficient heuristic approach since it often provides an optimal or near optimal solution to the transportation problem. In general, transportation problems involved in supply-chain management fields are unbalanced (total supply > tot...

Although a pilot national live-donor kidney exchange program was recently launched in the US, the kidney shortage is increasing faster than ever. A new solution paradigm is able to incorporate compatible pairs in exchange. In this paper, we consider an exchange framework that has both compatible and incompatible pairs, and patients are indifferent over compatible pairs. Only two-way exchanges a...