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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adolphson D, Hu TC (1973) Optimal linear ordering. SIAM J Appl Math 25:403–423
Bertacco L (2008) The linear ordering problem with cumulative costs. Eur J Oper Res 189:1345–1357
Duffus D, Rival I, Winkler P (1982) Minimizing setups for cycle-free ordered sets. Proc Am Math Soc 85:509–513
Ghazal H, Sharary A, Zaguia N (1988) On minimizing jump number for interval orders. Order 4:341–350
He W, Kusiak A (1992) Scheduling manufacturing system. Comput Ind 20:163–175
Syslo MM (1984) Minimizing the jump number for partially-ordered sets: a graph-theoretic approach. Order 1:7–20
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by National Nature Science Foundation of China (grant 10671177) and Zhejiang Provincial Natural Science Foundation of China (Y607079).
Rights and permissions
About this article
Cite this article
Wu, B., Yao, E. & Liu, L. A polynomially solvable case of optimal linear extension problem of a poset. J Comb Optim 20, 422–428 (2010). https://doi.org/10.1007/s10878-009-9218-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-009-9218-9