Mathematical Optimization Theory and Operations Research : Recent Trends : 22nd International Conference, MOTOR 2023, Ekaterinburg, Russia, July 2-8, 2023, Revised Selected Papers / / Michael Khachay [and five others] (editors)

• Pubblicazione: Cham, Switzerland : , : Springer, , [2023]; ©2023
• Edizione: First edition.
• Descrizione fisica: 1 online resource (412 pages)
• Disciplina: 519.3
• Soggetto topico: Mathematical optimization; Operations research
• Persona (resp. second.): KhachayMikhail Yu
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: Intro -- Preface -- Organization -- Contents -- Invited Papers -- Towards Subderivative-Based Zeroing Neural Networks -- 1 Introduction -- 2 Problem Statement and Research Questions -- 3 Possible Solutions -- 4 Models with Singular Cases -- 5 Concluding Remarks -- References -- Mathematical Programming -- An Algorithm for Decentralized Multi-agent Feasibility Problems -- 1 Introduction -- 2 The Penalty Approach for Multi-agent Decentralized System -- 3 An Algorithm for Decentralized Multi-agent Feasible Problem -- 4 Computational Experiments -- 5 Conclusions -- References -- Online Optimization Problems with Functional Constraints Under Relative Lipschitz Continuity and Relative Strong Convexity Conditions -- 1 Mirror Descent for Relatively Strongly Convex and Relatively Lipschitz-Continuous Online Optimization Problems with Inequality Constraints -- 2 Online Mirror Descent with Regularization -- 3 The Case of Online Optimization Problems with Inequality Constraints -- 4 Numerical Experiments -- References -- A Cutting Method with Successive Use of Constraint Functions in Constructing Approximating Sets -- 1 Introduction -- 2 The Problem Settings -- 3 The Minimization Method -- 4 The Convergence Proof -- References -- Implementing One Variant of the Successive Concessions Method for the Multi-objective Optimization Problem -- 1 Introduction -- 2 Problem Setting -- 3 The Variant of the Successive Concessions Method -- 4 Implementing the Method and Its Discussion -- 5 The Convergence Proof -- References -- Stochastic Optimization -- UCB Strategy for Gaussian and Bernoulli Multi-armed Bandits -- 1 Introduction -- 2 Gaussian Multi-armed Bandit -- 3 Bernoulli Multi-armed Bandit -- 4 Calculation of Regrets -- 5 Search for Optimal Values -- 6 Numerical Results -- 7 Conclusion -- References. ; Estimation of Both Unknown Parameters in Gaussian Multi-armed Bandit for Batch Processing Scenario -- 1 Introduction -- 2 UCB Strategy -- 2.1 Batch Version of the Strategy -- 3 Invariant Description -- 3.1 Estimating the Variance -- 3.2 Invariant Description for Normalized Regret -- 4 Simulation Results -- 5 Conclusions -- References -- Zero-Order Stochastic Conditional Gradient Sliding Method for Non-smooth Convex Optimization -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Paper Organization -- 2 Related Works -- 3 Setup -- 3.1 Assumptions -- 3.2 Notation -- 4 Main Result -- 4.1 Smoothing Scheme Intuition -- 4.2 Smooth Approximation -- 4.3 Gradient via l2 Randomization -- 4.4 Zero-Order Stochastic Conditional Gradient Sliding Method -- 5 Discussion -- 6 Experiments -- 7 Conclusion -- References -- Discrete and Combinatorial Optimization -- Tabu Search Metaheuristic for the Penalty Minimization Personnel Task Scheduling Problem -- 1 Introduction -- 2 Problem Statement and MIP Formulation -- 3 Solution Approach -- 3.1 Tabu Search -- 4 Computational Experiments -- 4.1 MIP Solvers -- 4.2 Tabu Search -- 5 Conclusion -- References -- An O(nlogn)-Time Algorithm for Linearly Ordered Packing of 2-Bar Charts into OPT+1 Bins -- 1 Introduction -- 1.1 Related Results -- 2 Formulation of the Problem -- 3 Bipartite Graph Constructing -- 3.1 Algorithm Construct -- 4 Maximal Matching in the Correct Bipartite Graph -- 5 Constructing a Solution to the 2-BCPP1 -- 5.1 Algorithm Delete_Cycles -- 5.2 OPT+1 Approximation -- 6 Conclusion -- References -- Approximation Algorithms for Graph Cluster Editing Problems with Cluster Size at Most 3 and 4 -- 1 Introduction -- 2 An Approximation Algorithm for Problem CE3 -- 3 An Approximation Algorithm for Problem CE4 -- 4 Conclusion -- References -- On Cone Partitions for the Min-Cut and Max-Cut Problems with Non-negative Edges. ; 1 Introduction -- 2 Cut Polytope and Cone Partition -- 3 Vertex Adjacency -- 4 Graph Diameter -- 5 Vertex Degrees -- 6 Conclusion -- References -- A Pattern-Based Heuristic for a Temporal Bin Packing Problem with Conflicts -- 1 Introduction -- 2 Formulation of the Problem -- 3 Column Generation -- 4 Upper Bounds -- 5 Computational Experiments -- 6 Conclusions -- References -- Integer Models for the Total Weighted Tardiness Problem on a Single Machine -- 1 Introduction -- 2 On a Minimal General Deadline -- 3 The Description of a Schedule Set and Jobs Completion Times in Graph Theory Terms -- 4 The Polyhedral Formulation of the Problem -- 5 Classes of Valid Inequalities -- 6 Probation of Models and Experimental Comparison of Relaxations -- 7 Conclusion -- References -- Solving Maximin Location Problems on Networks with Different Metrics and Restrictions -- 1 Introduction -- 2 Shortest Paths Metric -- 2.1 General Network -- 2.2 Tree Networks -- 3 Euclidean and Shortest Paths Metrics -- 3.1 Problem Formulation -- 3.2 Transportation Costs Function -- 3.3 Domain of Admissible Solutions -- 3.4 Algorithm -- 4 Conclusion -- References -- Operations Research -- On Probability Shaping for 5G MIMO Wireless Channel with Realistic LDPC Codes -- 1 Introduction -- 2 System Model -- 3 Optimal Distribution for Probability Shaping -- 3.1 Problem Statement -- 4 Coded Modulation Design for QAM-16 -- 4.1 Constellation Energy Minimisation -- 4.2 Amplitude Shaper and Sign Delay -- 4.3 Example of Generated Probabilities Using ESS -- 4.4 Probability Shaping Mapping -- 4.5 Arrangement of Finite Code Block Shapes -- 5 Numerical Experiments -- 5.1 Energy per Bit and Noise Ratio -- 5.2 Realistic Simulations Using Sionna -- 6 Conclusions and Suggested Future Work -- References -- Additive Routing Problem for a System of High-Priority Tasks -- 1 Introduction. ; 2 The Mathematical Setting -- 3 The General Scheme of Algorithm -- 4 Computing Experiment: Sheet Cutting Under Two Zones -- 5 Computing Experiment: Sheet Cutting by Zones in the General Case -- 6 Conclusion -- References -- Public-Private Partnership Model with a Consortium -- 1 Introduction -- 2 Mathematical Model -- 3 Computational Complexity -- 4 Results and Discussion -- References -- Variable Neighborhood Search Approach for the Bi-criteria Competitive Location and Design Problem with Elastic Demand -- 1 Introduction -- 2 Bi-criteria Robust Competitive Facility Location and Design Problem with Elastic Demand -- 3 Algorithms for the Bi-criteria Location Problem -- 4 Computational Experiments -- 5 Conclusions -- References -- Decomposition Approach for Simulation-Based Optimization of Inventory Management -- 1 Introduction -- 2 The Inventory Management Problem Formulation -- 3 Proposed Method -- 3.1 Two-Level Reformulation -- 3.2 Multi-agent Scheme -- 3.3 Worker Agents and One-Item Problem -- 4 Computational Results -- 4.1 Test Instances Description -- 4.2 Comparative Analysis -- 5 Conclusion -- References -- Optimal Control and Mathematical Economics -- The Algorithm for the Construction of a Symbolic Family of Regulators for Nonlinear Discrete Control Systems with Two Small Parameters -- 1 Introduction -- 2 Problem Statement -- 3 Numerical Experiments -- 4 Conclusion -- References -- Analytical Construction of the Singular Set in One Class of Time-Optimal Control Problems in the Presence of Linear Segments of the Boundary of the Target -- 1 Introduction -- 2 Problem Statement -- 3 Analytic Formulas for Constructing a Singular Set -- 4 Example of the Problem Solution -- 5 Conclusion -- References -- On the Existence of Fuzzy Contractual Allocations, Fuzzy Core and Perfect Competition in an Exchange Economy -- 1 Introduction. ; 2 An Economic Model, Fuzzy Core and Contractual Approach -- 2.1 Fuzzy Core and Fuzzy Contractual Allocations -- 3 Existence Theorems -- 4 Proofs -- References -- Linear Interpolation of Program Control with Respect to a Multidimensional Parameter in the Convergence Problem -- 1 Introduction -- 2 Problem Statement -- 3 Algorithms for Solving the Problem 1 -- 4 Error Estimation -- 5 Conclusion -- References -- Behavior of Stabilized Trajectories of a Two Factor Economic Growth Model Under the Changes of a Production Function Parameter -- 1 Introduction -- 2 Problem Statement -- 2.1 CES Production Function -- 2.2 Dynamic Growth Model and Control Problem -- 2.3 Problem Analysis -- 3 Qualitative Analysis -- 4 Stabilized Solutions -- 4.1 Stabilized Solutions for the Model with CES-Function -- 4.2 Sensitivity Analysis of the Stabilized Solutions -- 4.3 Numerical Results -- 5 Conclusion and Future Work -- References -- Optimization in Machine Learning -- Uncertainty of Graph Clustering in Correlation Block Model -- 1 Introduction -- 2 Basic Definitions and Notations -- 3 Correlation Block Model -- 4 Uncertainty of Clustering in Correlation Block Model -- 5 Comparison of Uncertainty of Clustering Algorithms -- 6 Conclusion -- References -- Multi-target Weakly Supervised Regression Using Manifold Regularization and Wasserstein Metric -- 1 Introduction -- 2 Problem Description -- 3 Related Work -- 4 Proposed Method -- 4.1 Objective Functional -- 4.2 Optimal Solution -- 5 Co-association Matrix: Multimetricity and Optimality -- 5.1 Multimetric Weighted Average Co-association Matrix -- 5.2 Optimal Weighted Average Co-association Matrix -- 6 C-WSR Algorithm -- 7 Experimental Results -- 7.1 Monte-Carlo Simulation -- 7.2 CO/NOx Dataset -- 8 Conclusion -- References -- Using General Least Deviations Method for Forecasting of Crops Yields -- 1 Introduction. ; 2 Data Organizing.
• Titolo autorizzato: Mathematical Optimization Theory and Operations Research
• ISBN: 3-031-43257-6
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996550553903316
• Lo trovi qui: Univ. di Salerno
• Serie: Communications in computer and information science ; ; Volume 1881.