{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T20:43:43Z","timestamp":1767905023204,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,4,25]],"date-time":"2008-04-25T00:00:00Z","timestamp":1209081600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fuzzy Optim Decis Making"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10700-008-9030-5","type":"journal-article","created":{"date-parts":[[2008,4,24]],"date-time":"2008-04-24T10:12:25Z","timestamp":1209031945000},"page":"105-118","source":"Crossref","is-referenced-by-count":22,"title":["The minimum spanning tree problem with fuzzy costs"],"prefix":"10.1007","volume":"7","author":[{"given":"Adam","family":"Janiak","sequence":"first","affiliation":[]},{"given":"Adam","family":"Kasperski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,25]]},"reference":[{"key":"9030_CR1","volume-title":"Network flows, theory, algorithms and applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja R.K., Magnanti T.L. and Orlin J.B. (1993). Network flows, theory, algorithms and applications. Prentice Hall, New Jersey"},{"key":"9030_CR2","unstructured":"Aron, I., & van Hentenryck, P. (2002). A constraint satisfaction approach to the robust spanning tree problem with interval data. In Proceedings of the 18 Conference on Uncertainty in Artificial Intelligence, Edmonton, Canada, pp 18\u201325."},{"issue":"1","key":"9030_CR3","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/S0167-6377(03)00058-0","volume":"32","author":"I. Aron","year":"2004","unstructured":"Aron I., van Hentenryck and P. (2004). On the complexity of the robust spanning tree problem with interval data. Operation Research Letters 32(1): 36\u201340","journal-title":"Operation Research Letters"},{"issue":"3","key":"9030_CR4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","volume":"138","author":"I. Averbakh","year":"2004","unstructured":"Averbakh I. and Lebedev V. (2004). Interval data mminmax regret network optimization problems. Discrete Applied Mathematics 138(3): 289\u2013301","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"9030_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0165-0114(00)00076-2","volume":"122","author":"S. Chanas","year":"2001","unstructured":"Chanas S. and Zieli\u0144ski P. (2001). Critical path analysis in the network with fuzzy activity times. Fuzzy Sets and Systems 122(2): 195\u2013204","journal-title":"Fuzzy Sets and Systems"},{"key":"9030_CR6","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/S0377-2217(01)00048-0","volume":"136","author":"S. Chanas","year":"2002","unstructured":"Chanas S. and Zieli\u0144ski P. (2002). The computational complexity of the criticality problems in a network with interval activity times. European Journal of Operational Research 136: 541\u2013550","journal-title":"European Journal of Operational Research"},{"key":"9030_CR7","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1109\/TSMCB.2002.1018760","volume":"32","author":"S. Chanas","year":"2002","unstructured":"Chanas S., Dubois D. and Zieli\u0144ski P. (2002). On the sure criticality of tasks in activity networks with imprecise durations. IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics 32: 393\u2013407","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics"},{"key":"9030_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-5287-7","volume-title":"Possibility theory: An approach to computerized processing of uncertainty","author":"D. Dubois","year":"1988","unstructured":"Dubois D. and Prade H. (1988). Possibility theory: An approach to computerized processing of uncertainty. Plenum Press, New York"},{"issue":"2","key":"9030_CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0377-2217(02)00558-1","volume":"147","author":"D. Dubois","year":"2003","unstructured":"Dubois D., Fargier H. and Fortemps P. (2003). Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge. European Journal of Operational Research 147(2): 231\u2013252","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"9030_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ipl.2005.11.001","volume":"97","author":"A. Kasperski","year":"2006","unstructured":"Kasperski A. and Zieli\u0144ski P. (2006). An approximation algorithm for interval data minmax regret combinatorial optimization problems. Information Processing Letters 97(5): 177\u2013180","journal-title":"Information Processing Letters"},{"issue":"2","key":"9030_CR11","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/j.ejor.2005.12.033","volume":"177","author":"A. Kasperski","year":"2007","unstructured":"Kasperski A. and Zieli\u0144ski P. (2007a). On combinatorial optimization problems on matroids with uncertain weights. European Journal of Operational Research 177(2): 851\u2013864","journal-title":"European Journal of Operational Research"},{"key":"9030_CR12","first-page":"656","volume":"4529","author":"A. Kasperski","year":"2007","unstructured":"Kasperski A. and Zieli\u0144ski P. (2007b). Using gradual numbers for solving fuzzy-valued combinatorial optimization problems. Lecture Notes in Artificial Intelligence 4529: 656\u2013665","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"9030_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"C. Kouvelis","year":"1997","unstructured":"Kouvelis C. and Yu G. (1997). Robust discrete optimization and its applications. Kluwer Academic Publishers, Boston"},{"issue":"3","key":"9030_CR14","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/j.ejor.2003.10.008","volume":"161","author":"R. Montemanni","year":"2005","unstructured":"Montemanni R. and Gambardella L.M. (2005). A branch and bound algorithm for the robust spanning tree problem with interval data. European Journal of Operational Research 161(3): 771\u2013779","journal-title":"European Journal of Operational Research"},{"key":"9030_CR15","unstructured":"Papadimitriou C., Steiglitz K. (1998). Combinatorial optimization, algorithms and complexity. Mineola, New York: Dover Publications Inc."},{"issue":"1","key":"9030_CR16","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0167-6377(01)00078-5","volume":"29","author":"H. Yaman","year":"2001","unstructured":"Yaman H., Kara\u015fan O.E. and Pinar M.C. (2001). The robust spanning tree problem with interval data. Operations Research Letters 29(1): 31\u201340","journal-title":"Operations Research Letters"}],"container-title":["Fuzzy Optimization and Decision Making"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10700-008-9030-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10700-008-9030-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10700-008-9030-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:01:14Z","timestamp":1559253674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10700-008-9030-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,25]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["9030"],"URL":"https:\/\/doi.org\/10.1007\/s10700-008-9030-5","relation":{},"ISSN":["1568-4539","1573-2908"],"issn-type":[{"value":"1568-4539","type":"print"},{"value":"1573-2908","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,25]]}}}