Minimizing the maximum bump cost in linear extensions of a poset

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

Journal of Combinatorial Optimization, 2013, vol. 26, issue 3, No 10, 509-519

Abstract: Abstract A linear extension of a poset P=(X,≺) is a permutation x 1,x 2,…,x |X| of X such that i

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

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9456-0 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:26:y:2013:i:3:d:10.1007_s10878-012-9456-0

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

DOI: 10.1007/s10878-012-9456-0

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 ().