A polynomially solvable case of optimal linear extension problem of a poset

DOI10.1007/s10878-009-9218-9zbMath1206.90156OpenAlexW2063149611MaRDI QIDQ613667

Longcheng Liu, Biao Wu, Enyu Yao

Publication date: 21 December 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9218-9

zbMATH Keywords

optimizationposetlinear extension

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Minimizing the maximum bump cost in linear extensions of a poset

Cites Work

• Minimizing the jump number for partially ordered sets: A graph-theoretic approach
• On minimizing the jump number for interval orders
• The linear ordering problem with cumulative costs
• Minimizing Setups for Cycle-Free Ordered Sets
• Optimal Linear Ordering

This page was built for publication: A polynomially solvable case of optimal linear extension problem of a poset