This book constitutes the revised selected papers from the 23rd International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2024, held in Omsk, Russia from June 30 to July 06, 2024. The 26 full papers included in this book were carefully reviewed and selected from 79 submissions. These papers have been organized in the following topical sections: Mathematical programming; Combinatorial optimization; Operations research; and Machine learning and optimization.
This book constitutes the revised selected papers from the 23rd International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2024, held in Omsk, Russia from June 30 to July 06, 2024.
The 26 full papers included in this book were carefully reviewed and selected from 79 submissions. These papers have been organized in the following topical sections: Mathematical programming; Combinatorial optimization; Operations research; and Machine learning and optimization.
Produktdetails
Produktdetails
Communications in Computer and Information Science 2239
Die Herstellerinformationen sind derzeit nicht verfügbar.
Inhaltsangabe
Mathematical Programming.- Optimal Convergence Rate for Mirror Descent Methods with Special Time-Varying Step Sizes Rules.- Numerical Methods for Variational Inequalities and Saddle Point Problems with Relative Inexact Information.- On Active-Set Methods for Quadratic Problems with Positive Semidefinite Matrices.- A Relaxed Cutting Method for the Convex Programming Problem.- Combinatorial Optimization.- On the Complexity of the Problem of Solving Systems of Tropical Polynomial Equations of Degree Two.- Super Domination Polynomial of a Graph.- A Fast Algorithm for Submodular Maximization with a Matroid Constraint.- Migrational Stability of Plane Tilings.-Maximin and Maxisum Network Location Problems with Various Metrics and Minimum Distance Constraints.- Operations Research.- Greedy Algorithms for the Temporal Bin Packing Problem with Failure Domain.- Energy-efficient Regular Strip Covering with Fixed-size Identical Sectors.- Optimal Placement of Mobile Sensors for Distance-Constrained Line Routing Problem.- Optimization of the Measurement Points Movement in One Problem of Synthesis of Temperature Control of a Furnace for Heating the Rods.- On the Method for Refining A Priori Estimates of the Objective Function in the Speed-in-Action Problem for a Linear Discrete-Time System.- Differential Information Economies: REE-equilibrium under Contract Based Approach.- Optimal Stopping Strategies in Gambler's Ruin Game.- Randomized Greedy Strategy with Corner Filling for the Irregular 2D Bin Packing Problem.- A Real-World Parcel Routing Problem: MIP Formulation.- Integer Programming Models and Metaheuristics for Customer Order Scheduling.- Machine Learning and Optimization.- Mini-batch K-means++ Clustering Initialization.- UCB Strategy for Batch Data Processing on an Unknown Horizon.- Pseudo-Polynomial Algorithms for Some Problems of Searching for the Largest Subsets.- Improved Credit Scoring Model with Hyperparameter Optimization.- Approximation Scheme for a Sequence Weighted 2-Clustering with a Fixed Center of One Cluster.- Numerical Investigation of the Swarm Intelligence Algorithm Obtained Using ChatGPT for Univariate Global Optimization.- Short-Term Voltage Instability Identification: A Combined Approach of Maximum Lyapunov Exponent and K-Means Clustering.
Mathematical Programming.- Optimal Convergence Rate for Mirror Descent Methods with Special Time-Varying Step Sizes Rules.- Numerical Methods for Variational Inequalities and Saddle Point Problems with Relative Inexact Information.- On Active-Set Methods for Quadratic Problems with Positive Semidefinite Matrices.- A Relaxed Cutting Method for the Convex Programming Problem.- Combinatorial Optimization.- On the Complexity of the Problem of Solving Systems of Tropical Polynomial Equations of Degree Two.- Super Domination Polynomial of a Graph.- A Fast Algorithm for Submodular Maximization with a Matroid Constraint.- Migrational Stability of Plane Tilings.-Maximin and Maxisum Network Location Problems with Various Metrics and Minimum Distance Constraints.- Operations Research.- Greedy Algorithms for the Temporal Bin Packing Problem with Failure Domain.- Energy-efficient Regular Strip Covering with Fixed-size Identical Sectors.- Optimal Placement of Mobile Sensors for Distance-Constrained Line Routing Problem.- Optimization of the Measurement Points Movement in One Problem of Synthesis of Temperature Control of a Furnace for Heating the Rods.- On the Method for Refining A Priori Estimates of the Objective Function in the Speed-in-Action Problem for a Linear Discrete-Time System.- Differential Information Economies: REE-equilibrium under Contract Based Approach.- Optimal Stopping Strategies in Gambler's Ruin Game.- Randomized Greedy Strategy with Corner Filling for the Irregular 2D Bin Packing Problem.- A Real-World Parcel Routing Problem: MIP Formulation.- Integer Programming Models and Metaheuristics for Customer Order Scheduling.- Machine Learning and Optimization.- Mini-batch K-means++ Clustering Initialization.- UCB Strategy for Batch Data Processing on an Unknown Horizon.- Pseudo-Polynomial Algorithms for Some Problems of Searching for the Largest Subsets.- Improved Credit Scoring Model with Hyperparameter Optimization.- Approximation Scheme for a Sequence Weighted 2-Clustering with a Fixed Center of One Cluster.- Numerical Investigation of the Swarm Intelligence Algorithm Obtained Using ChatGPT for Univariate Global Optimization.- Short-Term Voltage Instability Identification: A Combined Approach of Maximum Lyapunov Exponent and K-Means Clustering.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826
