نتایج جستجو برای: extended restricted greedy
تعداد نتایج: 346020 فیلتر نتایج به سال:
In this paper we consider restricted identification (RI) protocols which enable strong authentication and privacy protection for access control in an unlimited number of domains. A single secret key per user is used to authenticate and derive his identity within any domain, while the number of domains is unlimited and the scheme guarantees unlinkability between identities of the same user in di...
In this paper, we propose a new hybrid heuristic to solve the Location Routing Problem with capacitated depots and capacitated vehicles. The heuristic combines a Greedy Randomized Adaptive Search Procedure to determine the depot locations to be established and a Variable Neighborhood Search to optimize the vehicle routes originating at the opened depots. Furthermore, we enhance the heuristic by...
The vehicle routing problem (VRP) aims to find a set of routes of minimum total length to serve the demand of a set of customers using a fleet of capacitated vehicles based at a central depot [6]. In this work we present a new extension of the VRP, the single truck and trailer routing problem with satellite depots (STTRPSD). To solve the STTRPSD we developed a hybrid metaheuristic based on gree...
The Triple Pattern Fragment (TPF) interface is a recent proposal for reducing server load in Web-based approaches to execute SPARQL queries over public RDF datasets. The price for less overloaded servers is a higher client-side load and a substantial increase in network load (in terms of both the number of HTTP requests and data transfer). In this paper, we propose a slightly extended interface...
We prove a simple relationship between extended binomial coefficients — natural extensions of the well-known binomial coefficients — and weighted restricted integer compositions. Moreover, we give a very useful interpretation of extended binomial coefficients as representing distributions of sums of independent discrete random variables. We apply our results, e.g., to determine the distribution...
in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
The goal of this paper is to study the performance Thresholding Greedy Algorithm (TGA) when we increase size greedy sums by a constant factor λ⩾1. We introduce so-called λ-almost and λ-partially bases. case λ=1 gives us classical definitions almost (strong) partially show that basis if only it for all (some) However, each λ>1, there exists an unconditional but not 1-partially greedy. Furthermor...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید