Dynamic Energy Budget theory meets individual-based modelling: a generic and accessible implementation Benjamin T. Martin*, Elke I. Zimmer, Volker Grimm and Tjalling Jager Department of Ecological Modelling, Helmholtz Centre for Environmental Research – UFZ, 04318 Leipzig, Germany; and FALW ⁄Department of Theoretical Biology, Vrije Universiteit Amsterdam, De Boelelaan 1085, NL-1081 HV Amsterdam...

Given a set of elements, each having a profit and cost associated with it, and a budget, the 0-1 knapsack problem finds a subset of the elements with maximum possible combined profit subject to the combined cost not exceeding the budget. In this paper we study a stochastic version of the problem in which the budget is random. We propose two different formulations of this problem, based on diffe...

Fixed charge solid transportation problems are formulated as profit maximization problems under a budget constraint at each destination. Here item is purchased in different depots at different prices. Accordingly the item is transported to different destinations from different depots using different vehicles. Unitsare sold from different destinations to the customers at different selling prices...

Utility maximization under a budget constraint is a classical problem in economics and management science. It is commonly assumed that the utility is a “nice” known analytic function, for example, continuous and concave. In many domains, such as marketing, increased availability of computational resources and data has enabled the development of sophisticated simulations to evaluate the impact o...

The problem of maximizing the spread of influence with a limited budget is central to social networks research. Most problems addressed in existing literature spend the entire budget towards triggering diffusion at seed nodes. In this paper, we investigate the effect of splitting the budget across two sequential phases; each phase corresponds to a different way of spreading influence. In phase ...

Purpose – The paper introduces an evolutionary algorithm based on the artificial immune systems paradigm for topology optimization in 3D. Design/methodology/approach –The 3D topology optimization algorithm is described, and experimentally validated on an electromagnetic design problem. Findings – The proposed method is capable of finding an optimal configuration for the validation problem used....

An excess delay each component of a design can tolerate under a given timing constraint, is referred to as a delay budget. Delay budgeting has been widely exploited to improve the design quality. We present an optimal integer delay budgeting algorithm. Due to numerical instability and discreteness of libraries of components during design optimization flow, integer solution for delay budgeting i...

In this paper, we consider task-level scheduling algorithms with res-pect to budget and deadline constraints for a bag of MapReduce jobs on a set of provisioned heterogeneous (virtual) machines in cloud platforms. Heterogeneity is manifested in the ”pay-as-you-go” charging model we use, where service machines with different performance have different service rates. We organize the bag of jobs a...

We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two-stage network optimization, one defers a subset of the flow decisions until after the realization of the uncertain demand. Availability of such a recourse action allows one to come up with less conservative solutions compared to singlestage optimization. However, this ...

We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two-stage network optimization one defers a subset of the flow decisions until after the realization of the uncertain demand. Availability of such a recourse action allows one to come up with less conservative solutions compared to single-stage optimization. However, this ...