Skip to main content
SpringerLink
Log in
Book cover

Mathematical Optimization Theory and Operations Research

19th International Conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020, Revised Selected Papers

  • Conference proceedings
  • © 2020

Overview

Editors:
  1. Yury Kochetov

    1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Igor Bykadorov

    1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Tatiana Gruzdeva

    1. Matrosov Institute for System Dynamics and Control Theory, Irkutsk, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Communications in Computer and Information Science (CCIS, volume 1275)

Included in the following conference series:

Conference proceedings info: MOTOR 2020.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (33 papers)

  1. Front Matter

    Pages i-xvi
    Download chapter PDF

  2. Combinatorial Optimization

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem

      • Alexander Ageev, Alexander Kononov
      Pages 3-15

    3. On the Proximity of the Optimal Values of the Multi-dimensional Knapsack Problem with and Without the Cardinality Constraint

      • Aleksandr Yu. Chirkov, Dmitry V. Gribanov, Nikolai Yu. Zolotykh
      Pages 16-22

    4. An Approximation Algorithm for a Semi-supervised Graph Clustering Problem

      • Victor Il’ev, Svetlana Il’eva, Alexander Morshinin
      Pages 23-29

    5. Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem

      • Vladimir Khandeev, Anna Panasenko
      Pages 30-35

    6. Bilevel Models for Investment Policy in Resource-Rich Regions

      • Sergey Lavlinskii, Artem Panin, Alexander Plyasunov
      Pages 36-50

    7. One Problem of the Sum of Weighted Convolution Differences Minimization, Induced by the Quasiperiodic Sequence Recognition Problem

      • Sergey Khamidullin, Liudmila Mikhailova
      Pages 51-56

    8. Stability Analysis for Pricing

      • Artem A. Panin, Alexander V. Plyasunov
      Pages 57-69

    9. Easy NP-hardness Proofs of Some Subset Choice Problems

      • Artem V. Pyatkin
      Pages 70-79

    10. Sensitive Instances of the Cutting Stock Problem

      • Artem V. Ripatti, Vadim M. Kartak
      Pages 80-87

    11. Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions

      • Vladimir Shenmaier
      Pages 88-101

  3. Mathematical Programming

    1. Front Matter

      Pages 103-103
      Download chapter PDF

    2. Gradient-Free Methods with Inexact Oracle for Convex-Concave Stochastic Saddle-Point Problem

      • Aleksandr Beznosikov, Abdurakhmon Sadiev, Alexander Gasnikov
      Pages 105-119

    3. On Multiple Coverings of Fixed Size Containers with Non-Euclidean Metric by Circles of Two Types

      • Alexander Kazakov, Anna Lempert, Quang Mung Le
      Pages 120-132

    4. Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems

      • Alexander A. Titov, Fedor S. Stonyakin, Mohammad S. Alkousa, Seydamet S. Ablaev, Alexander V. Gasnikov
      Pages 133-149

    5. Constructing Mixed Algorithms on the Basis of Some Bundle Method

      • Rashid Yarullin
      Pages 150-163

  4. Global Optimization

    1. Front Matter

      Pages 165-165
      Download chapter PDF

    2. Near-Optimal Hyperfast Second-Order Method for Convex Optimization

      • Dmitry Kamzolov
      Pages 167-178

    3. On a Solving Bilevel D.C.-Convex Optimization Problems

      • Andrei V. Orlov
      Pages 179-191
Back to top

Other volumes

  1. Mathematical Optimization Theory and Operations Research

  2. Mathematical Optimization Theory and Operations Research

Keywords

About this book

This book constitutes refereed proceedings of the 19th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2020, held in Novosibirsk, Russia, in July 2020. Due to the COVID-19 pandemic the conference was held online.   

The 25 full papers and 8 short papers presented in this volume were carefully reviewed and selected from a total of 102 submissions. The papers in the volume are organised according to the following topical headings: ​combinatorial optimization; mathematical programming; global optimization; game theory and mathematical economics; heuristics and metaheuristics; machine learning and data analysis.

Editors and Affiliations

  • Sobolev Institute of Mathematics, Novosibirsk, Russia

    Yury Kochetov, Igor Bykadorov

  • Matrosov Institute for System Dynamics and Control Theory, Irkutsk, Russia

    Tatiana Gruzdeva

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation