Models, Algorithms, and Technologies for Network Analysis

Proceedings of the Second International Conference on Network Analysis

ISBN: 978-1-4614-8587-2 (Print) 978-1-4614-8588-9 (Online)

Table of contents (13 chapters)

  1. Front Matter

    Pages I-XIV

  2. Chapter

    Pages 1-10

    Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem

  3. Chapter

    Pages 11-27

    Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times

  4. Chapter

    Pages 29-41

    Comparative Analysis of Two Similarity Measures for the Market Graph Construction

  5. Chapter

    Pages 43-69

    Heuristic Algorithm for the Cell Formation Problem

  6. Chapter

    Pages 71-83

    Efficiency Analysis of Branch Network

  7. Chapter

    Pages 85-91

    EEG Coherence in Right- and Left-Handers in Passive Visual Perception of Lines with Different Slope Angles

  8. Chapter

    Pages 93-99

    Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements

  9. Chapter

    Pages 101-126

    Summary and Semi-average Similarity Criteria for Individual Clusters

  10. Chapter

    Pages 127-148

    Kernel Principal Component Analysis: Applications, Implementation and Comparison

  11. Chapter

    Pages 149-174

    Distance-Based Clique Relaxations in Networks: s-Clique and s-Club

  12. Chapter

    Pages 175-190

    GRASP with Path-Relinking for Facility Layout

  13. Chapter

    Pages 191-201

    Comparative Analysis of the BRIC Countries Stock Markets Using Network Approach

  14. Chapter

    Pages 203-217

    Sensor Cover and Double Partition