A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
نویسندگان
چکیده
منابع مشابه
Fitting the Three-parameter Weibull Distribution by using Greedy Randomized Adaptive Search Procedure
The Weibull distribution is widely employed in several areas of engineering because it is an extremely flexible distribution with different shapes. Moreover, it can include characteristics of several other distributions. However, successful usage of Weibull distribution depends on estimation accuracy for three parameters of scale, shape and location. This issue shifts the attentions to the requ...
متن کاملA Greedy Randomized Adaptive Search Procedure for Job Shop Scheduling
In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is characterized by a fixed order of operations, each of which is to be processed on a specific machine for a specified duration. Each machine can process at most one job at a time and once a job initiates processing on a given machine it must complete processing uninterrupted. A sc...
متن کاملA Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization problems. The NP-complete Feedback Vertex Set (FVS) Problem is to find the minimum number of vertices that need to be removed from a directed graph so that the resulting graph has no directed cycle. The FVS problem has found appl...
متن کاملGreedy Randomized Adaptive Search Procedure for Traveling Salesman Problem
Greedy Randomized Adaptive Search Procedure for Traveling Salesman Problem. (May 2005) Seung Ho Lee, B.E., Korea University Chair of Advisory Committee: Dr. Sergiy Butenko In this thesis we use greedy randomize adaptive search procedure (GRASP) to solve the traveling salesman problem (TSP). Starting with nearest neighbor method to construct the initial TSP tour, we apply the 2-opt and the path-...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1994
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.42.5.860