Models, Algorithms, and Technologies for Network Analysis

1. Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem
Mikhail Batsyn, Boris Goldengorin, Anton Kocheturov, Panos M. Pardalos

2. Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times
Mikhail Batsyn, Boris Goldengorin, Pavel Sukhov, Panos M. Pardalos

3. Comparative Analysis of Two Similarity Measures for the Market Graph Construction
Grigory A. Bautin, Valery A. Kalyagin, Alexander P. Koldanov

4. Heuristic Algorithm for the Cell Formation Problem
Ilya Bychkov, Mikhail Batsyn, Pavel Sukhov, Panos M. Pardalos

5. Efficiency Analysis of Branch Network
Petr A. Koldanov

6. EEG Coherence in Right- and Left-Handers in Passive Visual Perception of Lines with Different Slope Angles
Maxim Viktorovich Lukoyanov

7. Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements
Evgeny Maslov, Mikhail Batsyn, Panos M. Pardalos

8. Summary and Semi-average Similarity Criteria for Individual Clusters
Boris Mirkin

9. Kernel Principal Component Analysis: Applications, Implementation and Comparison
Daniel Olsson, Pando Georgiev, Panos M. Pardalos

10. Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
Shahram Shahinpour, Sergiy Butenko

11. GRASP with Path-Relinking for Facility Layout
R. M. A. Silva, M. G. C. Resende, P. M. Pardalos, G. R. Mateus, G. Tomi

12. Comparative Analysis of the BRIC Countries Stock Markets Using Network Approach
Arsenii Vizgunov, Andrey Glotov, Panos M. Pardalos

13. Sensor Cover and Double Partition
Lidong Wu, Weili Wu, Zaixin Lu, Yuqing Zhu, Ding-Zhu Du

Nyckelord: Mathematics, Optimization, Combinatorics, Operations Research, Management Science