Cantitate/Preț
Produs
Total produse
Vezi coșul
Models, Algorithms, and Technologies for Network Analysis: Proceedings of the Second International Conference on Network Analysis de Boris I. Goldengorin

Models, Algorithms, and Technologies for Network Analysis: Proceedings of the Second International Conference on Network Analysis: Springer Proceedings in Mathematics & Statistics, cartea 59

Editat de Boris I. Goldengorin, Valery A. Kalyagin, Panos M. Pardalos
en Limba Engleză Paperback – 27 aug 2016
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.

Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 61903 lei  6-8 săpt.
  Springer – 27 aug 2016 61903 lei  6-8 săpt.
  Springer – 28 ian 2015 91526 lei  6-8 săpt.
Hardback (2) 62334 lei  6-8 săpt.
  Springer – 21 sep 2013 62334 lei  6-8 săpt.
  Springer – 11 dec 2012 91968 lei  6-8 săpt.

Din seria Springer Proceedings in Mathematics & Statistics

Preț: 61903 lei

Preț vechi: 72827 lei
-15% Nou

Puncte Express: 929
Preț estimativ în valută:
11848€ • 12349$ • 9863£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781493953875
ISBN-10: 1493953877
Pagini: 217
Ilustrații: XIV, 217 p. 44 illus., 13 illus. in color.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.33 kg
Ediția:Softcover reprint of the original 1st ed. 2013
Editura: Springer
Colecția Springer
Seria Springer Proceedings in Mathematics & Statistics

Locul publicării:New York, NY, United States

Cuprins

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

Textul de pe ultima copertă

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.

Caracteristici

Presents state-of-the-art techniques from researchers and practitioners from different fields Presents new tools for developing practical algorithms for solving problems arising for different type of networks Summarizes the current state of network research and formulates many open questions in the analysis of huge sized networks? Includes supplementary material: sn.pub/extras