Models, Algorithms, and Technologies for Network Analysis [electronic resource] : Proceedings of the Second International Conference on Network Analysis /
International Conference on Network Analysis(2nd :2012 :Nizhny Novgorod, Russia)
Goldengorin, Boris I.editor.
Kalyagin, Valery A.editor.
Pardalos, Panos M.editor.(orcid)0000-0003-2824-101Xhttps://orcid.org/0000-0003-2824-101Xedt
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.
Description based upon print version of record.
Includes bibliographical references and index.
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).
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.
Mathematical optimization.
Combinatorics.
Operations research.
Management science.
Optimization.
Combinatorics.
Operations Research, Management Science.