A tabu search approach to the jump number problem
Vernadsky National Library of Ukraine
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
A tabu search approach to the jump number problem
|
|
| Creator |
Krysztowiak, P.
Sysło, M.M. |
|
| Description |
We consider algorithmics for the jump numberproblem, which is to generate a linear extension of a given poset,minimizing the number of incomparable adjacent pairs. Since thisproblem is NP-hard on interval orders and open on two-dimensionalposets, approximation algorithms or fast exact algorithms are indemand.In this paper, succeeding from the work of the second namedauthor on semi-strongly greedy linear extensions, we develop ametaheuristic algorithm to approximate the jump number with thetabu search paradigm. To benchmark the proposed procedure, weinfer from the previous work of Mitas [Order 8 (1991), 115–132] anew fast exact algorithm for the case of interval orders, and from theresults of Ceroi [Order 20 (2003), 1–11] a lower bound for the jumpnumber of two-dimensional posets. Moreover, by other techniqueswe prove an approximation ratio ofn/log lognfor 2D orders.
|
|
| Date |
2019-06-22T12:15:04Z
2019-06-22T12:15:04Z 2015 |
|
| Type |
Article
|
|
| Identifier |
A tabu search approach to the jump number problem / P. Krysztowiak, M.M. Sysło // Algebra and Discrete Mathematics. — 2015. — Vol. 20, № 1. — С. 89–114. — Бібліогр.: 28 назв. — англ.
1726-3255 2010 MSC:90C27, 90C59. http://dspace.nbuv.gov.ua/handle/123456789/158002 |
|
| Language |
en
|
|
| Relation |
Algebra and Discrete Mathematics
|
|
| Publisher |
Інститут прикладної математики і механіки НАН України
|
|