Eremeev / Khachay / Kochetov | Mathematical Optimization Theory and Operations Research | E-Book | sack.de
E-Book

E-Book, Englisch, Band 14766, 464 Seiten, eBook

Reihe: Lecture Notes in Computer Science

Eremeev / Khachay / Kochetov Mathematical Optimization Theory and Operations Research

23rd International Conference, MOTOR 2024, Omsk, Russia, June 30–July 6, 2024, Proceedings
Erscheinungsjahr 2024
ISBN: 978-3-031-62792-7
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

23rd International Conference, MOTOR 2024, Omsk, Russia, June 30–July 6, 2024, Proceedings

E-Book, Englisch, Band 14766, 464 Seiten, eBook

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-031-62792-7
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark



This book constitutes the refereed proceedings of the 23rd International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2024, held in Omsk, Russia, during June 30 - July 6, 2024. The 30 full papers included in this book were carefully reviewed and selected from 79 submissions. This book also contains two invited talk. They were organized in topical sections as follows: mathematical programming; combinatorial optimization; game theory; and operations research.
Eremeev / Khachay / Kochetov Mathematical Optimization Theory and Operations Research jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


.- Invited Papers.
.- Mathematical modeling of the interest rates formation on consumer loans in Russia.
.- Recent Advances in Minimax Problem and Bimatrix Games.
.- Mathematical Programming.
.- Assessing the Perron-Frobenius Root of Symmetric Positive Semidefinite Ma trices by the Adaptive Steepest Descent Method.
.- How to use barriers and symmetric regularization of Lagrange function in analysis of improper nonlinear programming problems.
.- Accelerated Stochastic Gradient Method with Applications to Consensus Problem in Markov-Varying Networks.
.- Combinatorial Optimization.
.- Tabu Search for a Service Zone Clustering Problem.
.- Clustering Complexity and an Approximation Algorithm for a Version of the Cluster Editing Problem.
.- A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types.
.- One Optimization Problem Induced by the Segregation Problem for the Sum of Two Quasiperiodic Sequences.
.- On 1-skeleton of the cut polytopes.
.- Temporal Bin Packing Problems with Placement Constraints: MIP-Models and Complexity.
.- Branching Algorithms for the Reliable Production Process Design Problem.
.- The Problem of Planning Investment Projects with Lending.
.- Stochastic Greedy Algorithms for a Temporal Bin Packing Problem with Placement Groups.
.- Fast Heuristics for a Staff Scheduling Problem with Time Interval Demand Coverage.
.- Game Theory.
.- Potential Game in General Transport Network with Symmetric Externalities.
.- Decision Analysis of Military Supply Chain Based on Stackelberg Game Model.
.- UCB Strategies in a Gaussian Two-Armed Bandit Problem.
.- On a Global Search in Bilevel Optimization Problems with a Bimatrix Game at the Lower Level.
.- Differential Network Games with Different Type of Players Behavior.
.- Network Structure Properties and Opinion Dynamics in Two-layer Networks with Hypocrisy.
.- Dynamic Stability of Coalition Structures in Network-Based Pollution Con trol Games.
.- Operations Research.
.- Robustness of Graphical Lasso Optimization Algorithm for Learning a Graphical Model.
.- A Unified Framework of Multi-Stage Multi-Winner Voting: An Axiomatic Exploration.
.- Production and Infrastructure Construction in a Resource Region: a Comparative Analysis of Mechanisms for Forming a Consortium of Subsoil Users.
.- utomated and Automatic Systems of Management of an Optimization Pro grams Package for Decisions Making.
.- Filtering Correction for Robotic Arms Multipurpose Regulators.
.- On the Optimal Management of Energy Storage.
.- On the Application of Saddle-Point Methods for Combined Equilibrium Transportation Models.
.- Stadium Antennas Deployment Optimization.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.