Linked e-resources
Details
Table of Contents
Intro; Preface; References; Contents; Contributors; Network Computational Algorithms; Tabu Search for Fleet Size and Mix Vehicle Routing Problem with Hard and Soft Time Windows; 1 Introduction; 2 Mathematical Model; 3 Algorithm Description; 3.1 Initial Solution; 3.2 Solution Improvement; 4 Computational Experiments; 4.1 VRPTW Results Comparison; 4.2 Results for FSMVRPSTW; 5 Conclusion; References; FPT Algorithms for the Shortest Lattice Vector and Integer Linear Programming Problems; 1 Introduction; 2 FPT Algorithm for the SVP; 3 The SVP for a Special Class of Lattices
4 Integer Linear Programming Problem (ILPP)5 Conclusion; References; The Video-Based Age and Gender Recognition with Convolution Neural Networks; 1 Introduction; 2 Materials and Methods; 2.1 Literature Survey; 2.2 Proposed Algorithm; 3 Experimental Results and Discussion; 4 Conclusion and Future Work; References; On Forbidden Induced Subgraphs for the Class of Triangle-König Graphs; 1 Introduction; 2 Notation and Definitions; 3 The Simplest Minimal Forbidden Induced Subgraph; 4 Belts; 5 Rings; 6 Common Theorem; References
The Global Search Theory Approach to the Bilevel Pricing Problem in Telecommunication Networks1 Introduction; 2 Problem Statement and Reduction; 3 Special Local Search Method; 4 Global Search; 5 Implementation of the GSA; 6 Case Study; 7 Concluding Remarks; References; Graph Dichotomy Algorithm and Its Applications to Analysis of Stocks Market; 1 Introduction; 2 Dichotomy Complexity of Graph; 2.1 Frequency Dichotomy Algorithm; 2.2 Family of Dichotomies and Its Properties; 3 Stock Market Analysis; 3.1 Everyday Complexity Values for SampP-500; 3.2 Short-Term Prediction of Big Crises
4 ConclusionReferences; Cluster Analysis of Facial Video Data in Video Surveillance Systems Using Deep Learning; 1 Introduction; 2 Cluster Analysis in Video Data; 3 Experimental Results; 4 Conclusion; References; Using Modular Decomposition Technique to Solve the Maximum Clique Problem; 1 Introduction; 2 Modular Decomposition Algorithm; 3 The Maximum Clique Solver Based on the Modular Decomposition Tree; 4 Results on DIMACS Benchmarks; 5 Algorithms for Generating Graphs with Modules; 5.1 Graphs of Mutual Simplicity; 5.2 Co-Graphs; 6 Results on Generated Graphs
6.1 Graphs of Mutual Simplicity6.2 Co-Graphs; 7 Conclusion; References; Network Models; Robust Statistical Procedures for Testing Dynamics in Market Network; 1 Introduction; 2 Methodology; 3 Experimental Results; 4 Rejection Graph; 5 Concluding Remarks; References; Application of Market Models to Network Equilibrium Problems; 1 Introduction; 2 A General Multi-commodity Market Equilibrium Model; 3 Partial Linearization Methods; 4 A Generalization of Network Equilibrium Problems with Elastic Demands
4 Integer Linear Programming Problem (ILPP)5 Conclusion; References; The Video-Based Age and Gender Recognition with Convolution Neural Networks; 1 Introduction; 2 Materials and Methods; 2.1 Literature Survey; 2.2 Proposed Algorithm; 3 Experimental Results and Discussion; 4 Conclusion and Future Work; References; On Forbidden Induced Subgraphs for the Class of Triangle-König Graphs; 1 Introduction; 2 Notation and Definitions; 3 The Simplest Minimal Forbidden Induced Subgraph; 4 Belts; 5 Rings; 6 Common Theorem; References
The Global Search Theory Approach to the Bilevel Pricing Problem in Telecommunication Networks1 Introduction; 2 Problem Statement and Reduction; 3 Special Local Search Method; 4 Global Search; 5 Implementation of the GSA; 6 Case Study; 7 Concluding Remarks; References; Graph Dichotomy Algorithm and Its Applications to Analysis of Stocks Market; 1 Introduction; 2 Dichotomy Complexity of Graph; 2.1 Frequency Dichotomy Algorithm; 2.2 Family of Dichotomies and Its Properties; 3 Stock Market Analysis; 3.1 Everyday Complexity Values for SampP-500; 3.2 Short-Term Prediction of Big Crises
4 ConclusionReferences; Cluster Analysis of Facial Video Data in Video Surveillance Systems Using Deep Learning; 1 Introduction; 2 Cluster Analysis in Video Data; 3 Experimental Results; 4 Conclusion; References; Using Modular Decomposition Technique to Solve the Maximum Clique Problem; 1 Introduction; 2 Modular Decomposition Algorithm; 3 The Maximum Clique Solver Based on the Modular Decomposition Tree; 4 Results on DIMACS Benchmarks; 5 Algorithms for Generating Graphs with Modules; 5.1 Graphs of Mutual Simplicity; 5.2 Co-Graphs; 6 Results on Generated Graphs
6.1 Graphs of Mutual Simplicity6.2 Co-Graphs; 7 Conclusion; References; Network Models; Robust Statistical Procedures for Testing Dynamics in Market Network; 1 Introduction; 2 Methodology; 3 Experimental Results; 4 Rejection Graph; 5 Concluding Remarks; References; Application of Market Models to Network Equilibrium Problems; 1 Introduction; 2 A General Multi-commodity Market Equilibrium Model; 3 Partial Linearization Methods; 4 A Generalization of Network Equilibrium Problems with Elastic Demands