This Volume Contains Two Types Of Papers—a Selection Of Contributions From The “second International Conference In Network Analysis” Held In Nizhny Novgorod On May 7–9, 2012, And Papers Submitted To An Open Call For Papers Reflecting The Activities Of Latna At The Higher School For Economics. This Volume Contains Many New Results In Modeling And Powerful Algorithmic Solutions Applied To Problems In •         Vehicle Routing •         Single Machine Scheduling •         Modern Financial Markets •         Cell Formation In Group Technology •         Brain Activities Of Left- And Right-handers •         Speeding Up Algorithms For The Maximum Clique Problem •         Analysis And Applications Of Different Measures In Clustering  the Broad Range Of Applications That Can Be Described And Analyzed By Means Of A Network Brings Together Researchers, Practitioners, And Other Scientific Communities From Numerous Fields Such As Operations Research, Computer Science, Bioinformatics, Medicine, Transportation, Energy, Social Sciences, And More. The Contributions Not Only Come From Different Fields, But Also Cover A Broad Range Of Topics Relevant To The Theory And Practice Of Network Analysis. Researchers, Students, And Engineers From Various Disciplines Will Benefit From The State-of-the-art In Models, Algorithms, Technologies, And Techniques Including New Research Directions And Open Questions. Models, Algorithms, And Technologies For Network Analysis (v.a. Kalyagin, B. Goldengorin, P.m. Pardalos) -- Tolerance-based Vs. Cost-based Branching For The Asymmetric Capacitated Vehicle Routing Problem (m. Batsyn, B. Goldengorin, A. Kocheturov, p.m. Pardalos) -- Lower And Upper Bounds For The Preemptive Single Machine Scheduling Problem With Equal Processing Times (m. Batsyn, B. Goldengorin, P. Sukhov, P.m. Pardalos) -- Comparative Analysis Of Two Similarity Measures For The Market Graph Construction (g. A. Bautin, V.a. Kalyagin, A.p. Koldanov) -- Heuristic Algorithm For The Cell Formation Problem (i. Bychkov, M. Batsyn, P. Sukhov, P.m. Pardalos) -- Efficiency Analysis Of Branch Network (p.a. Koldanov) -- Eeg Coherence In Right- And Left-handers In Passive Visual Perception Of Lines With Different Slope Angles (l.m. Viktorovich) -- Speeding Up Mcs Algorithm For The Maximum Clique Problem With Ils Heuristic And Other Enhancements (e. Maslov, M. Batsyn, P.m. Pardalos) -- Summary And Semi-average Similarity Criteria For Individual Clusters (b. Mirkin) -- Kernel Principal Component Analysis: Applications, Implementation, And Comparison (d. Olsson, P. Georgiev, V. Boginski, A. Sorokin, P.m. Pardalos) -- Distance-based Clique Relaxations In Networks: S-clique And S-club (s. Shahinpour, S. Butenko) -- Grasp With Path-relinking For Facility Layout (r.m.a. Silva, M.g.c. Resende, P.m. Pardalos, G.r. Mateus, G. De Tomi) -- Comparative Analysis Of The Bric Countries Stock Markets Using Network Approach (a. Vizgunov, A. Glotov, P.m. Pardalos) -- Sensor Cover And Double Partition (l. Wu, W. Wu, L. Lu, Y. Zhu, D.-z. Du). Edited By Boris I. Goldengorin, Valery A. Kalyagin, Panos M. Pardalos.

lgli/10.1007%2F978-1-4614-8588-9.pdf

lgrsnf/10.1007%2F978-1-4614-8588-9.pdf

scihub/10.1007/978-1-4614-8588-9.pdf

zlib/Science (General)/Mikhail Batsyn, Boris Goldengorin (auth.), Boris I. Goldengorin, Valery A. Kalyagin, Panos M. Pardalos (eds.)/Models, Algorithms, and Technologies for Network Analysis: Proceedings of the Second International Conference on Network Analysis_2172192.pdf

Boris I. Goldengorin, Valery A. Kalyagin, Panos M. Pardalos, Mikhail V. Batsyn

Goldengorin, Boris I.; Kalyagin, Valery A.; Pardalos, Panos M.

International Conference on Network Analysis

Springer New York : Imprint : Springer

Springer London, Limited

Springer US

Springer proceedings in mathematics & statistics, volume 59, New York, 2013

Springer Proceedings in Mathematics & Statistics, New York, NY, 2013

United States, United States of America

Sep 21, 2013

0

lg1183278

{"container_title":"Springer Proceedings in Mathematics & Statistics","edition":"1","isbns":["1461485878","1461485886","9781461485872","9781461485889"],"issns":["2194-1009","2194-1017"],"last_page":217,"publisher":"Springer New York","series":"Springer Proceedings in Mathematics & Statistics 59"}

Source title: Models, Algorithms, and Technologies for Network Analysis: Proceedings of the Second International Conference on Network Analysis (Springer Proceedings in Mathematics & Statistics)

This volume contains two types of papers a selection of contributions from the Second International Conference in Network Analysis held in Nizhny Novgorod on May 7 9, 2012, and papers submitted to an "open call for papers" reflecting the activities of LATNA at the Higher School for Economics. This volume contains many new results in modeling and powerful algorithmic solutions applied to problems in vehicle routing single machine scheduling modern financial markets cell formation in group technology brain activities of left- and right-handers speeding up algorithms for the maximum clique problem analysis and applications of different measures in clustering The broad range of applications that can be described and analyzed by means of a network brings together researchers, practitioners, and other scientific communities from numerous fields such as Operations Research, Computer Science, Bioinformatics, Medicine, Transportation, Energy, Social Sciences, and more. The contributions not only come from different fields, but also cover a broad range of topics relevant to the theory and practice of network analysis. Researchers, students, and engineers from various disciplines will benefit from the state-of-the-art in models, algorithms, technologies, and techniques including new research directions and open questions

Front Matter....Pages I-XIV
Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem....Pages 1-10
Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times....Pages 11-27
Comparative Analysis of Two Similarity Measures for the Market Graph Construction....Pages 29-41
Heuristic Algorithm for the Cell Formation Problem....Pages 43-69
Efficiency Analysis of Branch Network....Pages 71-83
EEG Coherence in Right- and Left-Handers in Passive Visual Perception of Lines with Different Slope Angles....Pages 85-91
Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements....Pages 93-99
Summary and Semi-average Similarity Criteria for Individual Clusters....Pages 101-126
Kernel Principal Component Analysis: Applications, Implementation and Comparison....Pages 127-148
Distance-Based Clique Relaxations in Networks: s -Clique and s -Club....Pages 149-174
GRASP with Path-Relinking for Facility Layout....Pages 175-190
Comparative Analysis of the BRIC Countries Stock Markets Using Network Approach....Pages 191-201
Sensor Cover and Double Partition....Pages 203-217

This volume compiles the major results of conference participants from the "Third International Conference in Network Analysis" held at the Higher School of Economics, Nizhny Novgorod in May 2013, with the aim to initiate further joint research among different groups. The contributions in this book cover a broad range of topics relevant to the theory and practice of network analysis, including the reliability of complex networks, software, theory, methodology, and applications. Network analysis has become a major research topic over the last several years. The broad range of applications that can be described and analyzed by means of a network has brought together researchers, practitioners from numerous fields such as operations research, computer science, transportation, energy, biomedicine, computational neuroscience and social sciences. In addition, new approaches and computer environments such as parallel computing, grid computing, cloud computing, and quantum computing have helped to solve large scale network optimization problems.

Springer Proceedings in Mathematics & Statistics
Erscheinungsdatum: 21.09.2013

2013-09-24