A tabu search approach to the jump number problem
We consider algorithmics for the jump number problem, which isto generate a linear extension of a given poset, minimizing the numberof incomparable adjacent pairs. Since this problem is NP-hardon interval orders and open on two-dimensional posets,approximation algorithms orfast exact algorithms are...
Gespeichert in:
| Datum: | 2015 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Lugansk National Taras Shevchenko University
2015
|
| Schlagworte: | |
| Online Zugang: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/101 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSchreiben Sie den ersten Kommentar!