{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:01Z","timestamp":1752378001899,"version":"3.41.2"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1023\/a:1008625405476","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"197-210","source":"Crossref","is-referenced-by-count":2,"title":["An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets"],"prefix":"10.1007","volume":"8","author":[{"given":"L.","family":"Bianco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Dell\u2018Olmo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Giordani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"136838_CR1","doi-asserted-by":"crossref","unstructured":"L. Bianco, P. Dell'Olmo, and S. Giordani, \"Exact and heuristic algorithms for the jump number problem,\" I.A.S.I., C.N.R. Tech. Rep., I.A.S.I., C.N.R., Rome, Italy, vol. 376, 1994.","DOI":"10.1007\/978-3-642-79459-9_27"},{"key":"136838_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"L.D. Bodin","year":"1983","unstructured":"L.D. Bodin, B.L. Golden, A.A. Assad, and M.O. Ball, \"Routing and scheduling of vehicles and crews,\" Comput. & Opns. Res., vol. 10, pp. 63\u2013211, 1983.","journal-title":"Comput. & Opns. Res."},{"key":"136838_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00337693","volume":"4","author":"V. Bouchitt\u00e9","year":"1987","unstructured":"V. Bouchitt\u00e9 and M. Habib, \"NP-completeness properties about linear extensions,\" Order, vol. 4, pp. 143\u2013154, 1987.","journal-title":"Order"},{"key":"136838_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1051\/ita\/1979130100031","volume":"13","author":"O. Cogis","year":"1979","unstructured":"O. Cogis and M. Habib, \"Nombre de Sauts et Graphes S\u00e9rie-parall\u00e8les,\" RAURO Inform. Th\u00e9or., vol. 13, pp. 3\u201318, 1979.","journal-title":"RAURO Inform. Th\u00e9or."},{"key":"136838_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00383598","volume":"1","author":"C.J. Colbourn","year":"1985","unstructured":"C.J. Colbourn and W.R. Pulleyblank, \"Minimizing setups in ordered sets of fixed width,\" Order, vol. 1, pp. 225\u2013229, 1985.","journal-title":"Order"},{"key":"136838_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1287\/trsc.27.4.315","volume":"27","author":"C.F. Daganzo","year":"1993","unstructured":"C.F. Daganzo and R.W. Hall, \"A routing model for pickups and deliveries: No capacity restrictions on the secondary items,\" Trans. Sci., vol. 27, pp. 315\u2013329, 1993.","journal-title":"Trans. Sci."},{"key":"136838_CR7","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1090\/S0002-9939-1982-0660592-3","volume":"85","author":"D. Duffus","year":"1982","unstructured":"D. Duffus, I. Rival, and P. Winkler \"Minimizing setups for cycle-free ordered sets,\" Proc. Am. Math. Soc., vol. 85, pp. 509\u2013513, 1982.","journal-title":"Proc. Am. Math. Soc."},{"key":"136838_CR8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(84)90124-8","volume":"19","author":"U. Faugle","year":"1984","unstructured":"U. Faugle and R. Schrader, \"Minimizing completion time for a class of scheduling problems,\" Inform. Process. Lett., vol. 19, pp. 27\u201329, 1984.","journal-title":"Inform. Process. Lett."},{"key":"136838_CR9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0167-6377(85)90027-6","volume":"4","author":"U. Faugle","year":"1985","unstructured":"U. Faugle and R. Schrader, \"A setup heuristic for interval orders,\" Opns. Res. Lett., vol. 4, pp. 185\u2013188, 1985.","journal-title":"Opns. Res. Lett."},{"key":"136838_CR10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00346129","volume":"6","author":"S. Felsner","year":"1990","unstructured":"S. Felsner, \"A 3\/2-approximation algorithm for the jump number of interval orders,\" Orders, vol. 6, pp. 325\u2013334, 1990.","journal-title":"Orders"},{"key":"136838_CR11","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1137\/0604016","volume":"4","author":"G. Gierz","year":"1983","unstructured":"G. Gierz and W. Poguntke, \"Minimizing setups for ordered sets: A linear algebrauc approach,\" SIAM J. Alg. Disc. Meth., vol. 4, pp. 132\u2013144, 1983.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"136838_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00383398","volume":"8","author":"J. Mitas","year":"1991","unstructured":"J. Mitas, \"Tackling the jump number problem for interval orders,\" Order, vol. 8, pp. 115\u2013132, 1991.","journal-title":"Order"},{"key":"136838_CR13","doi-asserted-by":"crossref","unstructured":"R.H. M\u00f6hring, \"Computationally tractable classes of ordered sets,\" in Algorithms and Order, I. Rival (Ed.), Kluwer Academic Publisher, pp. 105\u2013193, 1989.","DOI":"10.1007\/978-94-009-2639-4_4"},{"key":"136838_CR14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/158439.158908","volume":"25","author":"M.G. Norman","year":"1993","unstructured":"M.G. Norman and P. Thanisch, \"Models of machines and computation for mapping in multicomputers,\" ACM Comput. Surv., vol. 25, pp. 263\u2013302, 1993.","journal-title":"ACM Comput. Surv."},{"key":"136838_CR15","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1090\/S0002-9939-1983-0715851-3","volume":"89","author":"I. Rival","year":"1983","unstructured":"I. Rival, \"Optimal linear extensions by interchanging chauns,\" Proc. Amer. Math. Soc., vol. 89, pp. 387\u2013394, 1983.","journal-title":"Proc. Amer. Math. Soc."},{"key":"136838_CR16","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"M.W.P. Savelsbergh","year":"1995","unstructured":"M.W.P. Savelsbergh and M. Sol, \"The general pickup and delivery problem,\" Trans. Sci., vol. 29, pp. 17\u201329, 1995.","journal-title":"Trans. Sci."},{"key":"136838_CR17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF02248587","volume":"26","author":"G. Steiner","year":"1990","unstructured":"G. Steiner, \"On the complexity of dynamic programming for sequencing problems with precedence constraunts,\" Anns. Opns. Res., vol. 26, pp. 103\u2013123, 1990.","journal-title":"Anns. Opns. Res."},{"key":"136838_CR18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00396269","volume":"1","author":"M.M. Syslo","year":"1984","unstructured":"M.M. Syslo, \"Minimizing the jump-number for partially ordered sets: A graph-theoretic approach,\" Order, vol. 1, pp. 7\u201319, 1984.","journal-title":"Order"},{"key":"136838_CR19","doi-asserted-by":"crossref","unstructured":"M.M. Syslo, \"A graph-theoretic approach to the jump-number problem,\" in Graphs and Orders, I. Rival (Ed.), D. Reidel Publishing Company, pp. 185\u2013215, 1985.","DOI":"10.1007\/978-94-009-5315-4_6"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008625405476.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008625405476\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008625405476.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:03:42Z","timestamp":1752375822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008625405476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["136838"],"URL":"https:\/\/doi.org\/10.1023\/a:1008625405476","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}