{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T14:24:30Z","timestamp":1770906270192,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,5,29]],"date-time":"2009-05-29T00:00:00Z","timestamp":1243555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s10878-009-9237-6","type":"journal-article","created":{"date-parts":[[2009,5,28]],"date-time":"2009-05-28T18:32:13Z","timestamp":1243535533000},"page":"247-253","source":"Crossref","is-referenced-by-count":2,"title":["Minimizing the sum cost in linear extensions of a poset"],"prefix":"10.1007","volume":"21","author":[{"given":"Longcheng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Biao","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Enyu","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,29]]},"reference":[{"key":"9237_CR1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00337693","volume":"4","author":"V Bouchitte","year":"1987","unstructured":"Bouchitte V, Habib M (1987) NP-completeness properties about linear extensions. Order 4:143\u2013154","journal-title":"Order"},{"key":"9237_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0167-5060(08)70060-8","volume":"9","author":"M Chein","year":"1980","unstructured":"Chein M, Habib M (1980) The jump number of dags and posets: an introduction. Ann Discrete Math 9:189\u2013194","journal-title":"Ann Discrete Math"},{"key":"9237_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1051\/ita\/1979130100031","volume":"13","author":"O Cogis","year":"1979","unstructured":"Cogis O, Habib M (1979) Nombre de sauts et graphes series-paralleles. RAIRO Inform Th\u00e9or 13:3\u201318","journal-title":"RAIRO Inform Th\u00e9or"},{"key":"9237_CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1090\/S0002-9939-1982-0660592-3","volume":"85","author":"D Duffus","year":"1982","unstructured":"Duffus D, Rival I, Winkler P (1982) Minimizing setups for cycle-free orders sets. Proc Am Math Soc 85:509\u2013513","journal-title":"Proc Am Math Soc"},{"key":"9237_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF00403405","volume":"3","author":"PC Fishburn","year":"1986","unstructured":"Fishburn PC, Gehrlein WV (1986) Minimizing bumps in linear extensions of ordered sets. Order 3:3\u201314","journal-title":"Order"},{"key":"9237_CR6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1090\/S0002-9939-1983-0715851-3","volume":"83","author":"I Rival","year":"1983","unstructured":"Rival I (1983) Optimal linear extension by interchanging chains. Proc Am Math Soc 83:387\u2013394","journal-title":"Proc Am Math Soc"},{"key":"9237_CR7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00383200","volume":"7","author":"A Sharary","year":"1991","unstructured":"Sharary A, Zaguia N (1991a) On minimizing jumps for ordered sets. Order 7:353\u2013359","journal-title":"Order"},{"key":"9237_CR8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF00383447","volume":"8","author":"A Sharary","year":"1991","unstructured":"Sharary A, Zaguia N (1991b) The jump number of Z-free ordered sets. Order 8:267\u2013273","journal-title":"Order"},{"key":"9237_CR9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF00340778","volume":"3","author":"G Steiner","year":"1987","unstructured":"Steiner G, Stewart LK (1987) A linear algorithm to find the jump number of 2-dimensional bipartite partial orders. Order 3:359\u2013367","journal-title":"Order"},{"key":"9237_CR10","author":"B Wu","year":"2009","unstructured":"Wu B, Yao EY, Liu LC (2009) A polynomially solvable case of optimal linear extension problem of a poset. J Comb Optim (to appear). doi: 10.1007\/s10878-009-9218-9","journal-title":"J Comb Optim"},{"key":"9237_CR11","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF00337888","volume":"4","author":"N Zaguia","year":"1987","unstructured":"Zaguia N (1987) Greedy posets for the bump-minimizing problem. Order 4:257\u2013267","journal-title":"Order"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9237-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9237-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9237-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:14Z","timestamp":1559276294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9237-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,29]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["9237"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9237-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,29]]}}}