Abstract Large imaging surveys, such as the Legacy Survey of Space and Time, rely on photometric redshifts tomographic binning for 3 × 2 pt analyses that combine galaxy clustering weak lensing. In this paper, we propose a method optimizing choice lens sample galaxies. We divide CosmoDC2 Buzzard simulated catalogs into training set an application set, where is nonrepresentative in realistic way,...

We study a class of non-convex optimization problems involving sigmoid functions. We show that sigmoid functions impart a combinatorial element to the optimization variables and make the global optimization computationally hard. We formulate versions of the knapsack problem, the generalized assignment problem and the bin-packing problem with sigmoid utilities. We merge approximation algorithms ...

We consider a natural generalization of multiprocessor scheduling, the bin scheduling problem. Here, we model the situation in which working resources are available during separate time windows, or shifts, only. Restricting to scheduling without job preemption, every task must be processed completely during one shift. Our aim is to find a feasible schedule in which the number of required shifts...

Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...

A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, fij , for assigning item j to bin i; and a separate packing constraint for each bin—i.e., for each bin, a family of subsets of items that fit in to that bin. The goal is to pack items into bins to maximize the aggregate value. This class of problems includes the maximum generalized ...

Article history: Received 23 June 2015 Accepted 25 August 2015 Available online 2 September 2015