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

Biao Wu (), Enyu Yao and Longcheng Liu
Additional contact information
Biao Wu: Zhejiang University
Enyu Yao: Zhejiang University
Longcheng Liu: Xiamen University

Journal of Combinatorial Optimization, 2010, vol. 20, issue 4, No 8, 422-428

Abstract: Abstract In this paper, we consider an optimal linear extension problem of partial order. Under certain conditions, we prove the problem is polynomially solvable and present an algorithm to compute the solution.

Keywords: Poset; Linear extension; Optimization (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9218-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:20:y:2010:i:4:d:10.1007_s10878-009-9218-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-009-9218-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().