The issues of disparities, regional imbalance development and attempt to reducing development disparities among various regions have been attracted considerable attention among researchers, planners and policy makers. In this regard, this study employs a mathematical programing model for budget resources allocation among Iran provinces in order to development disparities reduction among them. I...

In this paper, we dealt with one problem in designing a production line, which is the problem of buffer allocation. A selection approach was developed and tested for selecting the best design for a huge number of alternatives set. The proposed selection approach is a combination between cardinal and ordinal optimization. The algorithm involves four procedures; ordinal optimization, optimal comp...

this comprehensive work explores the research performed inoptimization of the collection bin and in recycle bin location-allocation issues in solidwaste management. although the collection phase of solid waste management accountsfor a significant proportion of the municipal budget, it has attracted only limitedattention of the researchers. optimization of the collection bin and recycle bin loca...

Catholic Relief Services, a not-for-profit agency that funds development programs and humanitarian relief efforts throughout the world, faces a challenging budget-allocation problem annually. We developed a mathematical model and a spreadsheet tool that allocates available funds based on the impact these investments will have in different countries. The model ensures a fair allocation to countr...

Article history: Received 9 August 2015 Received in revised form 3 February 2016 Accepted 12 February 2016 Available online 17 February 2016 Communicated by A. Marchetti-Spaccamela

We consider the budget allocation problem over bipartite influence model proposed by Alon et al. (Alon et al., 2012). This problem can be viewed as the well-known influence maximization problem with budget constraints. We first show that this problem and its much more general form fall into a general setting; namely the monotone submodular function maximization over integer lattice subject to a...

In volunteer computing networks, the peers contribute to the solution of a computationally intensive problem by freely providing their computational resources, i.e., without seeking any immediate financial benefit. In such networks, although the peers can set certain bounds on how much their resources can be exploited by the network, the monetary cost that the network brings to the peers is unc...