Let H denote the set {f1, f2, ..., fn}, 2 the collection of all subsets of H and F ⊆ 2 be a family. The maximum of |F| is studied if any k subsets have a non-empty intersection and the intersection of any l distinct subsets (1 ≤ k < l) is empty. This problem is reduced to a covering problem. If we have the conditions that any two subsets have a non-empty intersection and the intersection of any...

parcel delivery is a complex logistic service, as it serves many small or medium-sized customers who may send or receive parcels. modeling such delivery system needs to integrate two different research areas of hub location and vehicle routing. as it totally depends on the network and the linkage of the nodes, in this paper, some door-to-door service providers are taken into account to provide ...

We use reformulation techniques to model and solve a complex sphere covering problem occurring in the configuration of a gamma ray machine radiotherapy equipment unit.

the corporate entrepreneurship (ce) of firms and enterprises is the subject of current research in the fields of management and business. however, analyses on this subject in agricultural firms are lacking. the purpose of this research was to study the relationships between corporate entrepreneurship and firm performance in agricultural small and medium-sized enterprises (asmes) in iran. specif...

This paper studies algorithms for the solution of mixed symmetric linear complementarity problems. The goal is to compute fast and approximate solutions of medium to large sized problems, such as those arising in computer game simulations and American options pricing. The paper proposes an improvement of a method described by Kocvara and Zowe [19] that combines projected Gauss-Seidel iterations...

This paper proposes a novel constraint-based 3G network-planning model and a novel hybrid approach for optimizing the 3G network-planning problem. Computational results show that the model and the approach are more efficient than the mathematical model and the existing heuristics. Optimal solutions are always obtained for small and medium sized problems. The proposed hybrid approach can be an e...

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...