Mathematical Optimization Theory and Operations Research
Home > Mathematics and Science Textbooks > Mathematics > Optimization > Mathematical Optimization Theory and Operations Research: 22nd International Conference, MOTOR 2023, Ekaterinburg, Russia, July 2–8, 2023, Proceedings(13930 Lecture Notes in Computer Science)
Mathematical Optimization Theory and Operations Research: 22nd International Conference, MOTOR 2023, Ekaterinburg, Russia, July 2–8, 2023, Proceedings(13930 Lecture Notes in Computer Science)

Mathematical Optimization Theory and Operations Research: 22nd International Conference, MOTOR 2023, Ekaterinburg, Russia, July 2–8, 2023, Proceedings(13930 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



International Edition


X
About the Book

This book constitutes the refereed proceedings of the 22nd  International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2023, held in Ekaterinburg, Russia, during July 2–8, 2023. The 28 full papers and 1 short paper included in this book were carefully reviewed and selected from 89 submissions. They were organized in topical sections as follows: Mathematical programming and applications; discrete and combinatorial optimization; stochastic optimization; scheduling; game theory; and optimal control and mathematical economics. The book also contains one invited talk in full paper length. 

Table of Contents:
​Invited papers.- General equilibrium models in production networks with substitution of inputs.- Mathematical programming and applications.- On decentralized nonsmooth optimization.- Byzantine-robust loopless stochastic variance-reduced gradient.- Semi-supervised k-means clustering via DC programming approach.- On the uniqueness of identification the thermal conductivity and heat capacit of substance.- On the uniqueness of identification the thermal conductivity and heat capacity of substance.- Discrete and combinatorial optimization.- Constant-factor approximation algorithms for some maximin multiclustering problems.- Aggregation tree construction using hierarchical structures.- Enumeration and unimodular equivalence of empty delta-modular simplices.- PTAS for p-means q-medoids r-given clustering problem.- Nested (2,3)-instances of the Cutting Stock Problem.- Stochastic optimization.- On theresource allocation problem to increase reliability of transport systems.- Distributionally robust optimization by probability criterion for estimating a bounded signal.- Scheduling.- Approximation algorithms for two-machine proportionate routing open shop on a tree.- MIP heuristics for a resource constrained project scheduling problem with workload stability constraints.- Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem.- Game theory.- Equilibrium arrivals to preemptive queueing system with fixed reward for completing request.- On optimal positional strategies in fractional optimal control problems.- On a single-type differential game of retention in a ring.- Harmonic numbers in Gambler’s Ruin Problem.- Exploitation and recovery periods in dynamic resource management problem.- Trade-off mechanism to sustain cooperation in pollution reduction.- Communication restriction-based characteristic function in differential games on networks.- Optimal control and mathematical economics.- Guaranteed expectation of the flock position with random distribution of items.- Method for solving a differential inclusion with a subdifferentiable support function of the right-hand side.- Approximate solution of small-time control synthesis problem based on linearization.- A Priori Estimates of the Objective Function in the Speed-in-Action Problem for a Linear Two-Dimensional Discrete-Time System.- An approach to solving input reconstruction problems in stochastic differential equations: dynamic algorithms and tuning their parameters.- Mathematical modeling of the household behavior on the labor market.- Visual positioning of a moving object using multi-objective control algorithm.


Best Sellers


Product Details
  • ISBN-13: 9783031353048
  • Publisher: Springer International Publishing AG
  • Publisher Imprint: Springer International Publishing AG
  • Height: 235 mm
  • No of Pages: 439
  • Returnable: Y
  • Sub Title: 22nd International Conference, MOTOR 2023, Ekaterinburg, Russia, July 2–8, 2023, Proceedings
  • ISBN-10: 3031353048
  • Publisher Date: 27 Jun 2023
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 13930 Lecture Notes in Computer Science
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Mathematical Optimization Theory and Operations Research: 22nd International Conference, MOTOR 2023, Ekaterinburg, Russia, July 2–8, 2023, Proceedings(13930 Lecture Notes in Computer Science)
Springer International Publishing AG -
Mathematical Optimization Theory and Operations Research: 22nd International Conference, MOTOR 2023, Ekaterinburg, Russia, July 2–8, 2023, Proceedings(13930 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Mathematical Optimization Theory and Operations Research: 22nd International Conference, MOTOR 2023, Ekaterinburg, Russia, July 2–8, 2023, Proceedings(13930 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!