Fixed set search applied to the multi-objective minimum weighted vertex cover problem
<p dir="ltr">The Fixed Set Search (FSS) is a novel metaheuristic that adds a learning mechanism to the Greedy Randomized Adaptive Search Procedure (GRASP). In recent publications, its efficiency has been shown on different types of combinatorial optimization problems like routing, ma...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Published: |
2022
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|