000763540 000__ 05845cam\a2200541Ii\4500
000763540 001__ 763540
000763540 005__ 20230306142315.0
000763540 006__ m\\\\\o\\d\\\\\\\\
000763540 007__ cr\cn\nnnunnun
000763540 008__ 161024s2016\\\\sz\\\\\\ob\\\\101\0\eng\d
000763540 019__ $$a962434511
000763540 020__ $$a9783319296081$$q(electronic book)
000763540 020__ $$a3319296086$$q(electronic book)
000763540 020__ $$z331929606X
000763540 020__ $$z9783319296067
000763540 035__ $$aSP(OCoLC)ocn961117485
000763540 035__ $$aSP(OCoLC)961117485$$z(OCoLC)962434511
000763540 040__ $$aN$T$$beng$$erda$$epn$$cN$T$$dN$T$$dGW5XE$$dIDEBK$$dEBLCP$$dAZU$$dYDX$$dOCLCF
000763540 049__ $$aISEA
000763540 050_4 $$aT57.85
000763540 08204 $$a658.4032$$223
000763540 1112_ $$aInternational Conference on Network Analysis$$n(4th :$$d2014 :$$cNizhny Novgorod, Russia).
000763540 24510 $$aModels, algorithms and technologies for network analysis :$$bNET 2014, Nizhny Novgorod, Russia, May 2014 /$$cValery A. Kalyagin, Petr A. Koldanov, Panos M. Pardalos, editors.
000763540 264_1 $$aSwitzerland :$$bSpringer,$$c[2016]
000763540 300__ $$a1 online resource.
000763540 336__ $$atext$$btxt$$2rdacontent
000763540 337__ $$acomputer$$bc$$2rdamedia
000763540 338__ $$aonline resource$$bcr$$2rdacarrier
000763540 4901_ $$aSpringer proceedings in mathematics & statistics ;$$vvolume 156
000763540 504__ $$aIncludes bibliographical references and index.
000763540 5050_ $$aPreface; References; Contents; Contributors; Part I Optimization in Networks; Maximally Diverse Grouping and Clique Partitioning Problems with Skewed General Variable Neighborhood Search; 1 Introduction; 2 Relation Between CPP and MDGP; 3 Solving MDGP with Variable Neighborhood Search; 3.1 Solution Space of MDGP; 3.2 VND Local Search; 3.3 Initial Solution; 3.4 Shaking; 3.5 Skewed General Variable Neighborhood Search; 4 Implementation Differences for Solving CPP with SGVNS; 5 Computational Results for MDGP; 5.1 VNS Parameter Values; 5.2 Comparison of Average Results
000763540 5058_ $$a6 Computational Results for CPP7 Conclusions; References; Test Generation for Digital Circuits Based on Continuous Approach to Circuit Simulation Using Different Continuous Extensions of Boolean Functions; 1 Introduction; 2 Continuous Approach of Digital Circuits Simulation; 3 Test Pattern Generation Algorithm; 4 Investigation of Various Continuous Models of Boolean Functions for Test Generation; 5 Results; 6 Conclusion; References; König Graphs for 4-Paths: Widened Cycles; 1 Introduction; 2 Some Definitions; 3 Widened Subdivisions of Even Cycles; 4 The Main Theorem; References
000763540 5058_ $$aOptimization Algorithms for Shared Groups in Multicast Routing1 Introduction; 1.1 Problem Formulation; 2 Literature Review; 2.1 Center-Based Approaches; 2.2 Mathematical Programming Formulation; 2.3 Distributed Algorithms for MGR; 3 Heuristics for Multicast Group Routing; 3.1 Tree Connection Heuristic; 3.2 Combined Shortest Path Heuristic; 4 Computational Results; 5 Concluding Remarks; References; Minimizing the Fuel Consumption of a Multiobjective Vehicle Routing Problem Using the Parallel Multi-Start NSGA II Algorithm; 1 Introduction
000763540 5058_ $$a2 Multiobjective Fuel Consumption Vehicle Routing Problem3 Parallel Multi-Start NSGA II Algorithm; 4 Evaluation Measures; 5 Computational Results; 6 Conclusions and Future Research; References; Manifold Location Routing Problem with Applications in Network Theory; 1 Introduction; 2 Riemannian Manifolds and Geodesic Distances; 3 MLRP Algorithmic Solution: Single-Facility Case; 3.1 Algorithmic Solution for 1-MLRP ; 3.2 Computational Complexity; 3.3 Algorithmic Solution Steps to Solve 1-MLRP; 3.4 Facility Locations on R2; 3.5 Projection from R2 to M
000763540 5058_ $$a4 Manifold Location Routing Problem: 2-Facility Case4.1 Statement of 2-MLRP; 5 Solution Methodology for 2-MLRP; 5.1 Main Steps of the Heuristic Algorithm; 5.2 Heuristic Algorithm for the Proposed 2-MLRP; 5.3 Computational Complexity; 5.4 Algorithmic Solution Details of 2-MLRP; 5.4.1 Projections from M to R2; 5.4.2 Initial Facility Locations and LCM: Heuristic Solution; 5.4.3 Mapping from R2 to M; 6 Applications in Network Theory; 7 Summary; References; A Branch and Bound Algorithm for the Cell Formation Problem; 1 Introduction; 2 Formulation; 3 Objective Functions; 4 Definitions
000763540 506__ $$aAccess limited to authorized users.
000763540 520__ $$aThe contributions in this volume cover a broad range of topics including maximum cliques, graph coloring, data mining, brain networks, Steiner forest, logistic and supply chain networks. Network algorithms and their applications to market graphs, manufacturing problems, internet networks and social networks are highlighted. The "Fourth International Conference in Network Analysis," held at the Higher School of Economics, Nizhny Novgorod in May 2014, initiated joint research between scientists, engineers and researchers from academia, industry and government; the major results of conference participants have been reviewed and collected in this Work. Researchers and students in mathematics, economics, statistics, computer science and engineering will find this collection a valuable resource filled with the latest research in network analysis.
000763540 588__ $$aOnline resource; title from PDF title page (viewed October 26, 2016).
000763540 650_0 $$aNetwork analysis (Planning)$$xComputer programs$$vCongresses.
000763540 7001_ $$aKalyagin, Valery A.,$$eeditor.
000763540 7001_ $$aKoldanov, Petr A.,$$eeditor.
000763540 7001_ $$aPardalos, Panos M.,$$eeditor.
000763540 77608 $$iPrint version:$$tModels, algorithms and technologies for network analysis.$$d[Place of publication not identified] : Springer, 2016$$z331929606X$$w(OCoLC)933713844
000763540 830_0 $$aSpringer proceedings in mathematics & statistics ;$$vv. 156.
000763540 852__ $$bebk
000763540 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-29608-1$$zOnline Access$$91397441.1
000763540 909CO $$ooai:library.usi.edu:763540$$pGLOBAL_SET
000763540 980__ $$aEBOOK
000763540 980__ $$aBIB
000763540 982__ $$aEbook
000763540 983__ $$aOnline
000763540 994__ $$a92$$bISE