Communications in Computer and Information Science - Optimization Problems and Their Applications
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319937991, 9783319938004

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem

Communications in Computer and Information Science - Optimization Problems and Their Applications ◽

10.1007/978-3-319-93800-4_8 ◽

2018 ◽

pp. 93-105 ◽

Cited By ~ 2

Author(s):

Aleksey O. Zakharov ◽

Yulia V. Kovalenko

Keyword(s):

Traveling Salesman Problem ◽

Pareto Set ◽

Traveling Salesman ◽

Asymmetric Traveling Salesman Problem

Download Full-text

Randomized Algorithms for Some Clustering Problems

Communications in Computer and Information Science - Optimization Problems and Their Applications ◽

10.1007/978-3-319-93800-4_9 ◽

2018 ◽

pp. 109-119 ◽

Cited By ~ 8

Author(s):

Alexander Kel’manov ◽

Vladimir Khandeev ◽

Anna Panasenko

Keyword(s):

Randomized Algorithms ◽

Clustering Problems

Download Full-text

A Core Heuristic and the Branch-and-Price Method for a Bin Packing Problem with a Color Constraint

Communications in Computer and Information Science - Optimization Problems and Their Applications ◽

10.1007/978-3-319-93800-4_25 ◽

2018 ◽

pp. 309-320 ◽

Cited By ~ 2

Author(s):

Artem Kondakov ◽

Yury Kochetov

Keyword(s):

Bin Packing ◽

Packing Problem ◽

Branch And Price ◽

Bin Packing Problem

Download Full-text

Variant of the Cutting Plane Method with Approximation of the Set of Constraints and Auxiliary Functions Epigraphs

Communications in Computer and Information Science - Optimization Problems and Their Applications ◽

10.1007/978-3-319-93800-4_16 ◽

2018 ◽

pp. 193-204

Author(s):

I. Ya. Zabotin ◽

K. E. Kazaeva

Keyword(s):

Cutting Plane ◽

Cutting Plane Method ◽

Plane Method ◽

Auxiliary Functions

Download Full-text

Profit Maximization and Vehicle Fleet Planning for a Harbor Logistics Company

Communications in Computer and Information Science - Optimization Problems and Their Applications ◽

10.1007/978-3-319-93800-4_27 ◽

2018 ◽

pp. 331-342

Author(s):

Natalia B. Shamray ◽

Nina A. Kochetova

Keyword(s):

Profit Maximization ◽

Fleet Planning ◽

Logistics Company ◽

Vehicle Fleet

Download Full-text

Exact Solution of One Production Scheduling Problem

Communications in Computer and Information Science - Optimization Problems and Their Applications ◽

10.1007/978-3-319-93800-4_5 ◽

2018 ◽

pp. 56-67

Author(s):

Pavel Borisovsky

Keyword(s):

Exact Solution ◽

Production Scheduling ◽

Scheduling Problem

Download Full-text

On Vertices of the Simple Boolean Quadric Polytope Extension

Communications in Computer and Information Science - Optimization Problems and Their Applications ◽

10.1007/978-3-319-93800-4_13 ◽

2018 ◽

pp. 155-169

Author(s):

Andrei V. Nikolaev

Keyword(s):

Boolean Quadric Polytope

Download Full-text

Complexity of Bi-objective Buffer Allocation Problem in Systems with Simple Structure

Communications in Computer and Information Science - Optimization Problems and Their Applications ◽

10.1007/978-3-319-93800-4_22 ◽

2018 ◽

pp. 278-287

Author(s):

Alexandre B. Dolgui ◽

Anton V. Eremeev ◽

Mikhail Y. Kovalyov ◽

Vyacheslav S. Sigaev

Keyword(s):

Simple Structure ◽

Allocation Problem ◽

Buffer Allocation

Download Full-text

An Approximation Polynomial Algorithm for a Problem of Searching for the Longest Subsequence in a Finite Sequence of Points in Euclidean Space

Communications in Computer and Information Science - Optimization Problems and Their Applications ◽

10.1007/978-3-319-93800-4_10 ◽

2018 ◽

pp. 120-130 ◽

Cited By ~ 2

Author(s):

Alexander Kel’manov ◽

Artem Pyatkin ◽

Sergey Khamidullin ◽

Vladimir Khandeev ◽

Yury V. Shamardin ◽

...

Keyword(s):

Euclidean Space ◽

Polynomial Algorithm ◽

Finite Sequence ◽

Longest Subsequence ◽

Approximation Polynomial

Download Full-text

Inapproximability Lower Bounds for Open Shop Problems with Exact Delays

Communications in Computer and Information Science - Optimization Problems and Their Applications ◽

10.1007/978-3-319-93800-4_4 ◽

2018 ◽

pp. 45-55

Author(s):

Alexander Ageev

Keyword(s):

Lower Bounds ◽

Open Shop

Download Full-text

Communications in Computer and Information Science - Optimization Problems and Their ApplicationsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem

Randomized Algorithms for Some Clustering Problems

A Core Heuristic and the Branch-and-Price Method for a Bin Packing Problem with a Color Constraint

Variant of the Cutting Plane Method with Approximation of the Set of Constraints and Auxiliary Functions Epigraphs

Profit Maximization and Vehicle Fleet Planning for a Harbor Logistics Company

Exact Solution of One Production Scheduling Problem

On Vertices of the Simple Boolean Quadric Polytope Extension

Complexity of Bi-objective Buffer Allocation Problem in Systems with Simple Structure

An Approximation Polynomial Algorithm for a Problem of Searching for the Longest Subsequence in a Finite Sequence of Points in Euclidean Space

Inapproximability Lower Bounds for Open Shop Problems with Exact Delays

Communications in Computer and Information Science - Optimization Problems and Their Applications
Latest Publications