Preface; References; Contents; Contributors; Part I Optimization; Linear Max-Min Fairness in Multi-commodity Flow Networks; 1 Introduction; 1.1 MMF in Networks; 2 Solution Methodology; 2.1 MMF in Networks; 3 Conclusion; References; Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem; 1 Introduction; 2 The Cell Formation Problem; 3 Algorithm Description; 4 Computational Results; 5 Concluding Remarks; References; Efficient Methods of Multicriterial Optimization Based on the Intensive Use of Search Information; 1 Introduction; 2 Problem Statement

3 The Basics of the Approach3.1 Methods of Solving the Multicriterial Optimization Problems; 3.2 Dimensionality Reduction; 4 An Efficient Method for Solving the Multicriterial Optimization Problems Based on Reusing Search Information; 4.1 Method for Solving Global Optimization Problems; 4.2 Reusing Search Information to Efficiently Solve Multicriterial Problems; 5 Results of Computational Experiments; 6 Conclusions; References; Comparison of Two Heuristic Algorithms for a Location and Design Problem; 1 Introduction; 2 Problem Formulation; 3 Algorithms; 4 Experimental Study; 5 Conclusion

1.4 Sigmoid Commute Time and Sigmoid Corrected Commute-Time Kernels 16,25,321.5 Randomized Shortest Path and Free Energy Dissimilarity Measures 22; 2 Logarithmic Versus Plain Measures; 3 Competition by Copeland's Score; 3.1 Approach 22; 3.2 The Competition Results; 3.3 A Competition for 90th Percentiles; 4 Reject Curves; 4.1 Definition; 4.2 Results; 5 Graphs with Classes of Different Sizes; 6 Cluster Analysis on Several Classical Datasets; 7 Conclusion; References; Analysis of Russian Power Transmission Grid Structure: Small World Phenomena Detection; 1 Introduction