{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:04Z","timestamp":1746115864624,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642386091"},{"type":"electronic","value":"9783642386107"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38610-7_51","type":"book-chapter","created":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T01:25:06Z","timestamp":1370309106000},"page":"559-568","source":"Crossref","is-referenced-by-count":0,"title":["Distribution Network Characteristics in Rough Set Approach"],"prefix":"10.1007","author":[{"given":"Henryk","family":"Piech","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandra","family":"Ptak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","series-title":"Lecture Notes in Econom. and Math. Systems","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-51576-7","volume-title":"Assignment and Matching Problems","author":"R.E. Burkard","year":"1980","unstructured":"Burkard, R.E., Derigs, U.: Assignment and Matching Problems. Lecture Notes in Econom. and Math. Systems, vol.\u00a0184. Springer, New York (1980)"},{"key":"51_CR2","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1137\/0205051","volume":"5","author":"D. Cheriton","year":"1976","unstructured":"Cheriton, D., Tarjan, R.E.: Finding minimum spanning trees. SIAM J. Comput.\u00a05, 724\u2013742 (1976)","journal-title":"SIAM J. Comput."},{"key":"51_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/355873.355874","volume":"6","author":"T.Y. Cheung","year":"1980","unstructured":"Cheung, T.Y.: Computational comparison of eights methods for the maximum network flow problem. ACM Trans Math. Software\u00a06, 1\u201316 (1980)","journal-title":"ACM Trans Math. Software"},{"key":"51_CR4","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","volume":"26","author":"H. Crowder","year":"1980","unstructured":"Crowder, H., Padberg, M.W.: Solving large scale symmetric traveling salesman problems to optimality. Management Sci.\u00a026, 495\u2013509 (1980)","journal-title":"Management Sci."},{"key":"51_CR5","first-page":"215","volume":"27","author":"E.V. Denardo","year":"1979","unstructured":"Denardo, E.V., Fox, L.B.: Shortest - route methods: Reaching, pruning and buckets. Oper. Res.\u00a027, 215\u2013248 (1979)","journal-title":"Oper. Res."},{"key":"51_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/net.3230140208","volume":"14","author":"N. Deo","year":"1984","unstructured":"Deo, N., Pang, C.Y.: Shortest path algorithms: taxonomy and annotation. Networks\u00a014, 275\u2013323 (1984)","journal-title":"Networks"},{"key":"51_CR7","first-page":"249","volume":"22","author":"U. Derigs","year":"1980","unstructured":"Derigs, U., Heske, A.: A computational study on some methods for solving the cardinality matching problem. Angew. Inform. Jg.\u00a022, 249\u2013254 (1980)","journal-title":"Angew. Inform. Jg."},{"key":"51_CR8","volume-title":"Network flow theory","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R.: Network flow theory. Rand Corporation, Santa Monica (1956)"},{"key":"51_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canad. J. Math.\u00a08, 399\u2013404 (1956)","journal-title":"Canad. J. Math."},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0304-3975(81)90008-6","volume":"14","author":"Z. Galil","year":"1981","unstructured":"Galil, Z.: On the theoretical efficiency o f various network flow algorithms. Theoret. Comput. Sci.\u00a014, 103\u2013111 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"51_CR11","unstructured":"Glover, F., Klingman, D., Mote, J., Whitman, D.: Comprehensive computer evaluation and enhancement of maximum flow algorithms, Research. Report, 356, Center for Cybernetic Studies, University of Texas, Austin (1979)"},{"key":"51_CR12","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1287\/opre.28.3.694","volume":"28","author":"B. Golden","year":"1980","unstructured":"Golden, B., Bodin, L., Doyle, T., Steward, W.: Approximate travelling salesman algorithms. Oper. Res.\u00a028, 694\u2013711 (1980)","journal-title":"Oper. Res."},{"key":"51_CR13","volume-title":"Algorithms for network programming","author":"J.L. Kennington","year":"1980","unstructured":"Kennington, J.L., Helgason, R.V.: Algorithms for network programming. Wiley- Interscience, New York (1980)"},{"key":"51_CR14","volume-title":"Optimization Algorithms for Networks and Matroids","author":"E. Minieka","year":"1978","unstructured":"Minieka, E.: Optimization Algorithms for Networks and Matroids. Holt, Rinehart and Winston, New York (1978)"},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0165-0114(85)80029-4","volume":"17","author":"Z. Pawlak","year":"1985","unstructured":"Pawlak, Z.: Rough Sets and Fuzzy Sets. Fuzzy Sets and Systems\u00a017, 99\u2013102 (1985)","journal-title":"Fuzzy Sets and Systems"},{"key":"51_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z. Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough Sets. International Journal of Information and Computer Science\u00a011, 341\u2013356 (1982)","journal-title":"International Journal of Information and Computer Science"},{"key":"51_CR17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.1975.5.2.129","volume":"5","author":"A.R. Pierce","year":"1975","unstructured":"Pierce, A.R.: Bibliography on algorithms for shortest path, shortest spanning tree and related circuit routing problems. Networks\u00a05, 129\u2013149 (1975)","journal-title":"Networks"},{"key":"51_CR18","unstructured":"Tadeusiewicz, R.: Introduction to Inteligent Systems. In: Wilamowski, B.M., Irvin, J.D. (eds.) The Industrial Electronic Handbook, ch. 1, pp. 1-1 \u2013 1-12. CRC Press, Boca Raton (2011)"},{"issue":"4","key":"51_CR19","doi-asserted-by":"crossref","first-page":"193","DOI":"10.7494\/cmms.2010.4.0290","volume":"10","author":"R. Tadeusiewicz","year":"2010","unstructured":"Tadeusiewicz, R.: Place and role of Intelligence Systems in Computer Science. Computer Methodsin Material Science\u00a010(4), 193\u2013206 (2010)","journal-title":"Computer Methodsin Material Science"},{"key":"51_CR20","unstructured":"Zadeh, N.: Near - equivalence of network flow algorithms, Technical Report, 26, Dept. Operations Research, Stanford University, CA (1979)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38610-7_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T11:46:05Z","timestamp":1746013565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38610-7_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386091","9783642386107"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38610-7_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}