{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:16:47Z","timestamp":1759033007853},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540325291"},{"type":"electronic","value":"9783540325307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11676935_6","type":"book-chapter","created":{"date-parts":[[2006,2,14]],"date-time":"2006-02-14T13:53:46Z","timestamp":1139925226000},"page":"46-52","source":"Crossref","is-referenced-by-count":5,"title":["A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids"],"prefix":"10.1007","author":[{"given":"Adam","family":"Kasperski","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Zieli\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Aron, I., van Hentenryck, P.: A Constraint Satisfaction Approach to the Robust Spanning Tree with Interval Data. In: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, Edmonton, Canada (2002)"},{"key":"6_CR2","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1994","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1994)"},{"key":"6_CR3","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., Prade, H.: Possibility theory: an approach to computerized processing of uncertainty. Plenum Press, New York (1988)"},{"key":"6_CR4","volume-title":"Resource Allocation Problems","author":"T. Ibaraki","year":"1988","unstructured":"Ibaraki, T., Katoh, N.: Resource Allocation Problems. MIT Press, Cambridge (1988)"},{"key":"6_CR5","unstructured":"Kasperski, A., Zieli\u0144ski, P.: On combinatorial optimization problems on matroids with ill-known weights. In: Instytut Matematyki PWr., Wroclaw 2005 (2005); (raport serii PREPRINTY nr 34, submitted for publication in Eur. J. Oper. Res.)"},{"key":"6_CR6","volume-title":"Combinatorial optimization: networks and matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston (1976)"},{"key":"6_CR7","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, New York (1992)"},{"key":"6_CR8","doi-asserted-by":"publisher","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., Pinar, M.C.: The robust spanning tree problem with interval data. Oper. Res. Lett.\u00a029, 31\u201340 (2001)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Fuzzy Logic and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11676935_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:06Z","timestamp":1619507706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11676935_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540325291","9783540325307"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11676935_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}