Goldengorin / Pardalos / Kalyagin | Models, Algorithms, and Technologies for Network Analysis | Buch | 978-1-4939-5387-5 | sack.de

Buch, Englisch, Band 59, 217 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 3577 g

Reihe: Springer Proceedings in Mathematics & Statistics

Goldengorin / Pardalos / Kalyagin

Models, Algorithms, and Technologies for Network Analysis

Proceedings of the Second International Conference on Network Analysis

Buch, Englisch, Band 59, 217 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 3577 g

Reihe: Springer Proceedings in Mathematics & Statistics

ISBN: 978-1-4939-5387-5
Verlag: Springer


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, 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 presented.
Goldengorin / Pardalos / Kalyagin Models, Algorithms, and Technologies for Network Analysis jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


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).


Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.