An efficient tabu search algorithm for the linear ordering problem
Given a directed graph with n vertices, m edges and costs on the edges, the linear ordering problem (LOP) consists of finding a permutation of the vertices so that the total cost of the reverse edges is minimized, where an edge is called a reverse edge if its head vertex is at a position before the...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
The Japan Society of Mechanical Engineers
2022-10-01
|
| Edice: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
| Témata: | |
| On-line přístup: | https://www.jstage.jst.go.jp/article/jamdsm/16/4/16_2022jamdsm0041/_pdf/-char/en |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|