Mathematical Optimization Theory and Operations Research : 23rd International Conference, MOTOR 2024, Omsk, Russia, June 30-July 6, 2024, Proceedings

• Autore: Eremeev Anton
• Pubblicazione: Cham : , : Springer, , 2024; ©2024
• Edizione: 1st ed.
• Descrizione fisica: 1 online resource (484 pages)
• Altri autori: KhachayMichael KochetovYury MazalovVladimir PardalosPanos
• Nota di contenuto: Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Undirected Networks Immune to the Informational Braess's Paradox -- Recent Advances in Minimax Problem and Bimatrix Games -- Mathematical Modeling of the Consumer Loan Market in Russia -- Models and Methods for Optimization of Electric Public Transport Systems -- Tuning Methods for Minimization of Self-concordant Functions with Optimal Control -- Recent Progress in Domination Theory -- AI and Optimization for a Sustainable Future -- Exploring the Learning-Based Optimization Algorithms -- "Distributed Optimization +" in Networks: A New Framework -- Abstracts of Tutorials -- Black Box Optimization for Business Applications -- Application of GPU Computing to Solving Discrete Optimization Problems -- Contents -- Invited Papers -- Mathematical Modeling of the Interest Rates Formation on Consumer Loans in Russia -- 1 Introduction -- 2 The Household Behavior on the Consumer Loan Market -- 3 The Commercial Bank Behavior on the Consumer Loan Market -- 4 Numerical Results -- 5 Conclusion -- References -- Recent Advances in Minimax Problem and Bimatrix Games -- 1 Introduction -- 2 Maxmin and Minimax Problems -- 3 Bimatrix Game and Equilibriums -- 4 Nonzero Sum n-Person Game -- 5 Three Players Polymatrix Game -- 6 Multi Players Polymatrix Game -- 7 The Four-Players Triple Polymatrix Game -- 8 Conclusion -- References -- Mathematical Programming -- Assessing the Perron-Frobenius Root of Symmetric Positive Semidefinite Matrices by the Adaptive Steepest Descent Method -- 1 Introduction -- 2 Estimating the Spectral Radius of Symmetric Positive Semidefinite Matrices -- 3 Numerical Experiments -- 3.1 Practical Applications of ASDM to Estimating the Perron Root of Symmetric Matrices -- 4 Concluding Discussion -- A. (The computer printout corresponding to Example 2). ; B. (The computer printout associated with Example 3) -- C. (The computer printout corresponding to Example 4) -- D. (The computer printout corresponding to Example 5) -- E. (The computer printout associated with Example 6) -- References -- How to Use Barriers and Symmetric Regularization of Lagrange Function in Analysis of Improper Nonlinear Programming Problems -- 1 Introduction -- 2 Problem Statement, Definitions and Assumptions -- 3 Proposed Extension of the Lagrange Function -- 4 Algorithmic Aspects of the New Method -- 5 About Effective Controlling the Parameters of the Algorithm -- 6 Conclusion -- References -- Accelerated Stochastic Gradient Method with Applications to Consensus Problem in Markov-Varying Networks -- 1 Introduction -- 1.1 Technical Preliminaries -- 2 Problem and Assumptions -- 3 Main Results -- 4 Numerical Experiments -- 4.1 Problem Formulation -- 4.2 Setup -- 4.3 Results -- References -- Combinatorial Optimization -- Tabu Search for a Service Zone Clustering Problem -- 1 Introduction -- 2 Problem Statement -- 3 Problem Formulation -- 3.1 MIP Formulation -- 4 Bi-level Tabu Search Approach -- 4.1 Initial Solution Generation -- 4.2 Convex Geometry Constraints -- 4.3 Lower-Level Stochastic Local Search -- 4.4 Upper-Level Tabu Search -- 5 Computational Experiments -- 6 Conclusion -- References -- Clustering Complexity and an Approximation Algorithm for a Version of the Cluster Editing Problem -- 1 Introduction -- 2 An Approximation Algorithm for Problem CE5 -- 3 Bound on Clustering Complexity -- 4 Conclusion -- References -- A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types -- 1 Introduction -- 2 Preliminaries -- 2.1 Problem Definition -- 2.2 Prediction-Augmented Algorithms -- 2.3 Related Work -- 3 Lower Bound for Competitive Ratio -- 4 Prediction-Augmented Algorithm with Two Prediction Types. ; 5 Conclusion -- References -- One Optimization Problem Induced by the Segregation Problem for the Sum of Two Quasiperiodic Sequences -- 1 Introduction -- 2 Optimisation Problem and Related Problems -- 3 Polynomial-Time Solvability of the Problem -- 4 Algorithm A -- 5 Segregation Problem -- 6 Numerical Simulation -- 7 Conclusion -- References -- On 1-Skeleton of the Cut Polytopes -- 1 Introduction -- 2 Cut Polytopes -- 3 Adjacency -- 4 Trees, Cacti, and Almost Trees -- 4.1 Trees -- 4.2 Cacti -- 4.3 Almost Trees (2) -- 5 Complete Bipartite and k-Partite Graphs -- 5.1 Complete Bipartite Graphs -- 5.2 Complete Tripartite and k-Partite Graphs -- 6 Conclusion -- References -- Temporal Bin Packing Problems with Placement Constraints: MIP-Models and Complexity -- 1 Introduction -- 2 Problem Statements and MIP Formulations -- 2.1 Problem Statements of Minimizing the Number of Identical Bins -- 2.2 Problem Statement of Maximizing the Number of Batches -- 2.3 Allocation Rate Maximization -- 3 Computational Complexity -- 3.1 The Number of Item Types as a Part of the Problem Input -- 3.2 The Single Item Type Case -- 4 Conclusions -- References -- Branching Algorithms for the Reliable Production Process Design Problem -- 1 Introduction -- 2 Related Work -- 3 Problem Statement -- 4 Compact Formulation for RPPDP -- 5 Branch-and-Price Algorithm for the RPPDP -- 5.1 Route Formulation Model -- 5.2 Column Generation and Pricing Problem -- 5.3 Branching Scheme -- 5.4 Algorithm Description -- 6 Numerical Evaluation -- 6.1 Instance Benchmark -- 6.2 Experimental Setup -- 6.3 Results and Discussion -- 7 Conclusion -- References -- The Problem of Planning Investment Projects with Lending -- 1 Introduction -- 2 Scheduling Problem -- 3 Criteria Based on Net Present Value -- 4 Statement of the Problem of Investment Projects with Lending. ; 5 Complexity and Approaches to Solving the Problem -- References -- Stochastic Greedy Algorithms for a Temporal Bin Packing Problem with Placement Groups -- 1 Introduction -- 2 Problem Statement -- 3 Algorithms for Computing Bounds on the Minimum Number of Racks -- 3.1 Lower Bound -- 3.2 Upper Bound -- 4 Computational Experiments -- 4.1 Test Data Description -- 4.2 Results -- 5 Conclusions -- References -- Fast Heuristics for a Staff Scheduling Problem with Time Interval Demand Coverage -- 1 Introduction -- 2 Problem Statement -- 3 Problem Formulation -- 4 Solution Algorithms -- 4.1 Pattern-Driven Local Search -- 4.2 Randomized Greedy and Shift-Exchange Local Search -- 5 Computational Experiments -- 6 Conclusion -- References -- Game Theory -- Potential Game in General Transport Network with Symmetric Externalities -- 1 Introduction -- 2 Externalities in the General Transport System -- 3 A Formal Model of the Transport System -- 4 Wardrop Equilibrium -- 5 Social Costs -- 6 Price of Anarchy -- 7 Conclusion -- References -- Decision Analysis of Military Supply Chain Based on Stackelberg Game Model -- 1 Introduction -- 2 Problem Definition and Model Setup -- 2.1 Problem Definition -- 2.2 Model Assumptions -- 3 Methodology and Model -- 3.1 Type MC -- 3.2 Type MMEs -- 3.3 Type MUs -- 4 Comparative Analysis -- 5 Conclusion -- References -- UCB Strategies in a Gaussian Two-Armed Bandit Problem -- 1 Introduction -- 2 Recursive Equation for Computing a Regret -- 3 UCB Strategies and Properties of a Prior Distribution -- 4 Computing the Regret with Respect to Asymptotically Uniform Prior Distribution -- 5 Numerical Results -- 6 Conclusion -- References -- On a Global Search in Bilevel Optimization Problems with a Bimatrix Game at the Lower Level -- 1 Introduction -- 2 Problem Formulation and Its Transformation -- 3 D.C. Approach to the Problem. ; 4 Local Search Methods and Their Specificity -- 5 Global Search Scheme -- 6 Concluding Remarks -- References -- Differential Network Games with Different Types of Players Behavior -- 1 Differential Network Games -- 1.1 Cooperation and Characteristic Function -- 2 The Shapley Value -- 3 Conclusion -- References -- Network Structure Properties and Opinion Dynamics in Two-Layer Networks with Hypocrisy -- 1 Introduction -- 2 Model -- 2.1 Opinion Dynamics in One-Layer Networks -- 2.2 Opinion Dynamics in Two-Layer Networks -- 2.3 General Concealed Voter Model (macro Version) -- 2.4 General Concealed Voter Model (micro Version) -- 3 Network Properties -- 3.1 Pairwise Average Shortest Path -- 3.2 Density -- 3.3 Centrality Measures -- 4 Experiments -- 4.1 General Description -- 4.2 Main Results and Observations -- 5 Conclusions and Future Work -- References -- Dynamic Stability of Coalition Structures in Network-Based Pollution Control Games -- 1 Introduction -- 2 Theoretical Background -- 2.1 Model Formulation -- 2.2 Imputation Distribution Procedure -- 3 Asymmetric Three-Player Model in a Star Network Structure -- 3.1 Cooperative Case -- 3.2 Non-cooperative Case -- 3.3 Formation of Partial Coalitions -- 4 Analysis of Dynamically Stable Coalition Partition 1 -- 5 Conclusions -- A Time-consistent IDP calculations for 2 -- B Time-consistent IDP calculations for 3 -- References -- Operations Research -- Robustness of Graphical Lasso Optimization Algorithm for Learning a Graphical Model -- 1 Introduction -- 2 Graphical Model -- 3 Class of Distributions -- 4 Graphical Lasso Algorithms -- 5 Robustness of Graphical Model Selection Algorithms -- 5.1 Measures of Error for Graphical Model Selection Algorithms -- 5.2 Robustness. Theoretical Study -- 5.3 Graphical Model Generator -- 5.4 Robustness. Numerical Experiments -- 6 Conclusion -- References. ; A Unified Framework of Multi-stage Multi-winner Voting: An Axiomatic Exploration.
• Titolo autorizzato: Mathematical Optimization Theory and Operations Research
• ISBN: 9783031627927; 9783031627910
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910865261703321
• Lo trovi qui: Univ. Federico II
• Serie: Lecture Notes in Computer Science Series