טוען...
Iterated Local search for the Linear Ordering Problem
This paper addresses the linear ordering problem, which has been solved using different metaheuristics approaches. These algorithms have the common problem of finding a proper balance of the intensification and diversification processes; in this work we propose an iterated local search in which it i...
שמור ב:
| הוצא לאור ב: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Main Authors: | , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
International Journal of Combinatorial Optimization Problems and Informatics
2012
|
| נושאים: | |
| גישה מקוונת: | https://www.redalyc.org/articulo.oa?id=265224466003 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|