000790066 000__ 03639cam\a2200493Ii\4500
000790066 001__ 790066
000790066 005__ 20230306143356.0
000790066 006__ m\\\\\o\\d\\\\\\\\
000790066 007__ cr\cn\nnnunnun
000790066 008__ 170627s2017\\\\sz\\\\\\ob\\\\100\0\eng\d
000790066 020__ $$a9783319568294$$q(electronic book)
000790066 020__ $$a3319568299$$q(electronic book)
000790066 020__ $$z9783319568287
000790066 035__ $$aSP(OCoLC)ocn991854334
000790066 035__ $$aSP(OCoLC)991854334
000790066 040__ $$aN$T$$beng$$erda$$epn$$cN$T$$dN$T$$dGW5XE$$dEBLCP$$dUAB
000790066 049__ $$aISEA
000790066 050_4 $$aT57.85
000790066 08204 $$a658.4032$$223
000790066 1112_ $$aInternational Conference on Network Analysis$$n(6th :$$d2016 :$$cNizhny Novgorod, Russia)
000790066 24510 $$aModels, Algorithms, and Technologies for Network Analysis :$$bNET 2016, Nizhny Novgorod, Russia, May 2016 /$$cValery A. Kalyagin, Alexey I. Nikolaev, Panos M. Pardalos, Oleg A. Prokopyev, editors.
000790066 2463_ $$aNET 2016
000790066 264_1 $$aCham, Switzerland :$$bSpringer,$$c[2017]
000790066 300__ $$a1 online resource.
000790066 336__ $$atext$$btxt$$2rdacontent
000790066 337__ $$acomputer$$bc$$2rdamedia
000790066 338__ $$aonline resource$$bcr$$2rdacarrier
000790066 4901_ $$aSpringer proceedings in mathematics & statistics ;$$vvolume 197
000790066 504__ $$aIncludes bibliographical references.
000790066 5050_ $$aPreface; References; Contents; Contributors; Part I Optimization; Linear Max-Min Fairness in Multi-commodity Flow Networks; 1 Introduction; 1.1 MMF in Networks; 2 Solution Methodology; 2.1 MMF in Networks; 3 Conclusion; References; Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem; 1 Introduction; 2 The Cell Formation Problem; 3 Algorithm Description; 4 Computational Results; 5 Concluding Remarks; References; Efficient Methods of Multicriterial Optimization Based on the Intensive Use of Search Information; 1 Introduction; 2 Problem Statement
000790066 5058_ $$a3 The Basics of the Approach3.1 Methods of Solving the Multicriterial Optimization Problems; 3.2 Dimensionality Reduction; 4 An Efficient Method for Solving the Multicriterial Optimization Problems Based on Reusing Search Information; 4.1 Method for Solving Global Optimization Problems; 4.2 Reusing Search Information to Efficiently Solve Multicriterial Problems; 5 Results of Computational Experiments; 6 Conclusions; References; Comparison of Two Heuristic Algorithms for a Location and Design Problem; 1 Introduction; 2 Problem Formulation; 3 Algorithms; 4 Experimental Study; 5 Conclusion
000790066 5058_ $$a1.4 Sigmoid Commute Time and Sigmoid Corrected Commute-Time Kernels 16,25,321.5 Randomized Shortest Path and Free Energy Dissimilarity Measures 22; 2 Logarithmic Versus Plain Measures; 3 Competition by Copeland's Score; 3.1 Approach 22; 3.2 The Competition Results; 3.3 A Competition for 90th Percentiles; 4 Reject Curves; 4.1 Definition; 4.2 Results; 5 Graphs with Classes of Different Sizes; 6 Cluster Analysis on Several Classical Datasets; 7 Conclusion; References; Analysis of Russian Power Transmission Grid Structure: Small World Phenomena Detection; 1 Introduction
000790066 506__ $$aAccess limited to authorized users.
000790066 588__ $$aVendor-supplied metadata.
000790066 650_0 $$aNetwork analysis (Planning)$$xComputer programs$$vCongresses.
000790066 7001_ $$aKalyagin, Valery A.,$$eeditor.
000790066 7001_ $$aNikolaev, Alexey I.,$$eeditor.
000790066 7001_ $$aPardalos, P. M.$$q(Panos M.),$$d1954-$$eeditor.
000790066 7001_ $$aProkopyev, Oleg A.,$$eeditor.
000790066 830_0 $$aSpringer proceedings in mathematics & statistics ;$$vv. 197.
000790066 852__ $$bebk
000790066 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-56829-4$$zOnline Access$$91397441.1
000790066 909CO $$ooai:library.usi.edu:790066$$pGLOBAL_SET
000790066 980__ $$aEBOOK
000790066 980__ $$aBIB
000790066 982__ $$aEbook
000790066 983__ $$aOnline
000790066 994__ $$a92$$bISE