A tabu search approach to the jump number problem

MaRDI QIDQ5744543zbMATH OpenFDO

Authors Przemysław Krysztowiak, Maciej M. Sysło

Publication date 18 February 2016

zbMATH Keywords

combinatorial optimizationgraph theorytabu searchposetjump number

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 764417
• An optimal algorithm to find the jump number of partially ordered sets
• An improved approximation ratio for the jump number problem on interval orders
• A 3/2-approximation algorithm for the jump number of interval orders
• The jump number problem: exact and parameterized

Cited in

(2)

• scientific article; zbMATH DE number 764417 (Why is no real title available?)
• A refined analysis on the jump number problem of interval orders

This page was built for publication: A tabu search approach to the jump number problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5744543)