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

DOI10.1007/S10878-009-9218-9MaRDI QIDQ613667zbMATH OpenOpenAlexFDO

Authors Biao Wu, Enyu Yao, Longcheng Liu

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)

Recommendations

• Computing linear extensions for polynomial posets subject to algebraic constraints
• scientific article; zbMATH DE number 16221
• A class of polynomially solvable linear complementarity problems
• The linear extension polytope of a poset
• Polynomially solvable cases for the maximum stable set problem
• Minimizing the sum cost in linear extensions of a poset
• scientific article; zbMATH DE number 952616
• A class of linear complementarity problems solvable in polynomial time
• A polynomial algorithm for finding a prescribed number of best solutions of extremal problems on matroids
• On linear extensions of finite posets

Cites work

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

Cited in

(2)

• scientific article; zbMATH DE number 27746 (Why is no real title available?)
• Minimizing the maximum bump cost in linear extensions of a poset

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

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