Mathematical Optimization Theory and Operations Research - Communications in Computer and Information Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030586560, 9783030586577

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Weak Berge Equilibrium

Mathematical Optimization Theory and Operations Research - Communications in Computer and Information Science ◽

10.1007/978-3-030-58657-7_20 ◽

2020 ◽

pp. 231-243

Author(s):

Konstantin Kudryavtsev ◽

Ustav Malkov ◽

Vladislav Zhukovskiy

Keyword(s):

Berge Equilibrium

Constructing Mixed Algorithms on the Basis of Some Bundle Method

Mathematical Optimization Theory and Operations Research - Communications in Computer and Information Science ◽

10.1007/978-3-030-58657-7_14 ◽

2020 ◽

pp. 150-163

Author(s):

Rashid Yarullin

Keyword(s):

Bundle Method

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

Mathematical Optimization Theory and Operations Research - Communications in Computer and Information Science ◽

10.1007/978-3-030-58657-7_1 ◽

2020 ◽

pp. 3-15

Author(s):

Alexander Ageev ◽

Alexander Kononov

Keyword(s):

Approximation Algorithm ◽

Clustering Problem

Sensitive Instances of the Cutting Stock Problem

Mathematical Optimization Theory and Operations Research - Communications in Computer and Information Science ◽

10.1007/978-3-030-58657-7_9 ◽

2020 ◽

pp. 80-87

Author(s):

Artem V. Ripatti ◽

Vadim M. Kartak

Keyword(s):

Cutting Stock Problem ◽

Cutting Stock

Stability Analysis for Pricing

Mathematical Optimization Theory and Operations Research - Communications in Computer and Information Science ◽

10.1007/978-3-030-58657-7_7 ◽

2020 ◽

pp. 57-69

Author(s):

Artem A. Panin ◽

Alexander V. Plyasunov

Keyword(s):

Stability Analysis

An Approximation Algorithm for a Semi-supervised Graph Clustering Problem

Mathematical Optimization Theory and Operations Research - Communications in Computer and Information Science ◽

10.1007/978-3-030-58657-7_3 ◽

2020 ◽

pp. 23-29

Author(s):

Victor Il’ev ◽

Svetlana Il’eva ◽

Alexander Morshinin

Keyword(s):

Approximation Algorithm ◽

Graph Clustering ◽

Clustering Problem

Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem

Mathematical Optimization Theory and Operations Research - Communications in Computer and Information Science ◽

10.1007/978-3-030-58657-7_29 ◽

2020 ◽

pp. 363-378

Author(s):

Ilya V. Otpuschennikov ◽

Alexander A. Semenov

Keyword(s):

Local Search

Monopolistic Competition Model with Retailing

Mathematical Optimization Theory and Operations Research - Communications in Computer and Information Science ◽

10.1007/978-3-030-58657-7_24 ◽

2020 ◽

pp. 287-301

Author(s):

Olga Tilzo ◽

Igor Bykadorov

Keyword(s):

Monopolistic Competition ◽

Competition Model

Nonlinear Models of Convergence

Mathematical Optimization Theory and Operations Research - Communications in Computer and Information Science ◽

10.1007/978-3-030-58657-7_18 ◽

2020 ◽

pp. 207-215

Author(s):

Konstantin Gluschenko

Keyword(s):

Nonlinear Models

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

Mathematical Optimization Theory and Operations Research - Communications in Computer and Information Science ◽

10.1007/978-3-030-58657-7_13 ◽

2020 ◽

pp. 133-149

Author(s):

Alexander A. Titov ◽

Fedor S. Stonyakin ◽

Mohammad S. Alkousa ◽

Seydamet S. Ablaev ◽

Alexander V. Gasnikov

Keyword(s):

Convex Programming ◽

Lipschitz Continuous

Mathematical Optimization Theory and Operations Research - Communications in Computer and Information ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Weak Berge Equilibrium

Constructing Mixed Algorithms on the Basis of Some Bundle Method

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

Sensitive Instances of the Cutting Stock Problem

Stability Analysis for Pricing

An Approximation Algorithm for a Semi-supervised Graph Clustering Problem

Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem

Monopolistic Competition Model with Retailing

Nonlinear Models of Convergence

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

Mathematical Optimization Theory and Operations Research - Communications in Computer and Information Science
Latest Publications