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

DOI10.1007/S10878-009-9218-9zbMATH Open1206.90156OpenAlexW2063149611MaRDI QIDQ613667FDOQ613667

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

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

zbMATH Keywords

optimizationposetlinear extension

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Minimizing Setups for Cycle-Free Ordered Sets
• Optimal Linear Ordering
• 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

Cited In (2)

• Title not available (Why is that?)
• 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)