{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:34:58Z","timestamp":1649090098388},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,2,17]],"date-time":"2012-02-17T00:00:00Z","timestamp":1329436800000},"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":[[2013,10]]},"DOI":"10.1007\/s10878-012-9456-0","type":"journal-article","created":{"date-parts":[[2012,2,16]],"date-time":"2012-02-16T11:41:45Z","timestamp":1329392505000},"page":"509-519","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing the maximum bump cost in linear extensions of a poset"],"prefix":"10.1007","volume":"26","author":[{"given":"Biao","family":"Wu","sequence":"first","affiliation":[]},{"given":"Longcheng","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Enyu","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,17]]},"reference":[{"key":"9456_CR1","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 ordered sets. Proc Am Math Soc 85:509\u2013513","journal-title":"Proc Am Math Soc"},{"key":"9456_CR2","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":"9456_CR3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF00714476","volume":"4","author":"H Ghazal","year":"1988","unstructured":"Ghazal H, Sharary A, Zaguia N (1988) On minimizing jump number for interval orders. Order 4:341\u2013350","journal-title":"Order"},{"key":"9456_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00337617","volume":"5","author":"M Habib","year":"1988","unstructured":"Habib M, Mohring RH, Steiner G (1988) Computing the Bump number is easy. Order 5:107\u2013109","journal-title":"Order"},{"key":"9456_CR5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10878-009-9237-6","volume":"21","author":"L Liu","year":"2011","unstructured":"Liu L, Wu B, Yao E (2011) Minimizing the sum cost in linear extensions of a poset. J Comb Optim 21:247\u2013253","journal-title":"J Comb Optim"},{"key":"9456_CR6","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00337618","volume":"5","author":"AA Schaffer","year":"1988","unstructured":"Schaffer AA, Simons BB (1988) Computing the Bump number with techniques form two-processor scheduling. Order 5:131\u2013141","journal-title":"Order"},{"key":"9456_CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00396269","volume":"1","author":"MM Syslo","year":"1984","unstructured":"Syslo MM (1984) Minimizing the jump number for partially-ordered sets: a graph-theoretic approach. Order 1:7\u201320","journal-title":"Order"},{"key":"9456_CR8","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/s10878-009-9218-9","volume":"20","author":"B Wu","year":"2011","unstructured":"Wu B, Yao E, Liu L (2011) A\u00a0polynomially solvable case of optimal linear extension problem of a poset. J Comb Optim 20:422\u2013428","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9456-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9456-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9456-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:17Z","timestamp":1559262197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9456-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,17]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9456"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9456-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,17]]}}}