Zobrazeno 1 - 9
of 9
pro vyhledávání: '"I V, Urazova"'
Publikováno v:
Diskretnyi analiz i issledovanie operatsii. 28:48-67
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e157350bf237e858ea1cc29ea8d4628
https://doi.org/10.33048/daio.2021.28.697
https://doi.org/10.33048/daio.2021.28.697
Publikováno v:
Journal of Applied and Industrial Mathematics. 15:146-157
Under consideration are some polyhedral properties of the set of schedules for servicing identical requests by parallel devices. The requests satisfy some precedence conditions. Any service interruptions are prohibited. We propose some formalization
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92434489e1c359ef36f35ebc587b14c8
https://doi.org/10.1134/s1990478921010130
https://doi.org/10.1134/s1990478921010130
Publikováno v:
Journal of Applied and Industrial Mathematics. 13:539-556
A numerical study is carried out of the branch and cut method adapted for solving the clique partitioning problem (CPP). The problem is to find a family of pairwise disjoint cliques with minimum total weight in a complete edge-weighted graph. The two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::222ee76304053a8555e234158da04461
https://doi.org/10.1134/s1990478919030153
https://doi.org/10.1134/s1990478919030153
Autor:
R. Yu. Simanchev, I. V. Urazova
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030864323
The paper deals with a set of identical requirements processing schedules for parallel machines. The precedence constraints are set, interrupts are prohibited, time is discrete. This set of schedules is the set of feasible solutions to a number of op
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6203c49b9a355756a040f189b56ded56
https://doi.org/10.1007/978-3-030-86433-0_18
https://doi.org/10.1007/978-3-030-86433-0_18
Publikováno v:
Mathematical Optimization Theory and Operations Research ISBN: 9783030333935
MOTOR (2)
MOTOR (2)
In the clique partition problem (CPP), we need to find a spanning family of pairwise vertex-disjoint cliques of minimum total weight in a complete edge-weighted graph. In this paper, we consider the special case of the CPP, the so-called graph approx
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4df18fe028f604f2a7e482ab8df58eb
https://doi.org/10.1007/978-3-030-33394-2_20
https://doi.org/10.1007/978-3-030-33394-2_20
Autor:
I. V. Urazova, R. Yu. Simanchev
Publikováno v:
Journal of Applied and Industrial Mathematics. 9:283-291
We study the polytope of the graph approximation problem. Some polyhedral relaxation of this polytope is built. We describe the class of valid inequalities for this polytope among which the inequalities that generate the facets are allocated.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5dd8daa2630f7966a77e0c303d4ffe71
https://doi.org/10.1134/s1990478915020143
https://doi.org/10.1134/s1990478915020143
Autor:
I. V. Urazova, R. Yu. Simanchev
Publikováno v:
Automation and Remote Control. 71:2102-2108
We describe an integer-valued model of the total service time minimization problem for a partially ordered set of claims with identical servicing times, serviced in parallel by identical devices. We construct a target function over the polyhedron cor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81587fd132129e1ebbfb32dda06ea31b
https://doi.org/10.1134/s0005117910100097
https://doi.org/10.1134/s0005117910100097
Autor:
Ruslan Simanchev, I. V. Urazova
Publikováno v:
Discrete Optimization and Operations Research ISBN: 9783319449135
DOOR
DOOR
One of the central questions of polyhedral combinatorics is the question of the algorithmic relationship between vertex and facet descriptions of convex polytopes. In the sense of combinatorial optimization the reason for the relevance of this issue
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::470fc3dc6ea3afa5d89df5cf0e12a668
https://doi.org/10.1007/978-3-319-44914-2_19
https://doi.org/10.1007/978-3-319-44914-2_19
Autor:
F I, Kislykh, I V, Urazova
Publikováno v:
Stomatologiia.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::87dd623855c3d5fb739e559d7d3a6915
https://pubmed.ncbi.nlm.nih.gov/9281154
https://pubmed.ncbi.nlm.nih.gov/9281154