Modeling Local Scheduler Operation Based on Solution of Nonlinear Boolean Programming Problems

LISTROVAYA, E.S.; Bryksin, Volodymyr; Курцев, М. С.

doi:10.1007/s10559-017-9979-6

Cited by 1 publication

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Step 8. Using procedure B, we define a subset of vertices r * , starting with which inequality to (7). In this case, all the vertices in the list after r * are deleted from the graph G with edges incident to them and delete these vertices from the list .…”

Section: Methods Of Solving the Problemmentioning

confidence: 99%

“…This prompted specialists to search for opportunities to optimize resources, both in the technical and in the information management subsystem. Simulation of the work of a local scheduler on the basis of solving problems of nonlinear Boolean programming has already been considered by the authors in [7]. This will optimize computing resources and prevent premature investments in hardware infrastructure.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Formulation of the Problem of Maximum Clique Determination in Non-Oriented Graphs

Listrovoy¹,

Golovko²,

Butenko³

et al. 2018

IJET

View full text Add to dashboard Cite

In the train traffic organization, large amount of information should be processed in real time. Thereby in complicated dispatching systems, rational use of resources is needed. To perform this work a model of a management system is constructed and it is represented as a sparse graph. Further optimization of the model requires solving the Maximum Clique Problem (MCP) for the less time than the exponential time. This article contains two procedures for solving the task for subexponential time. Procedure B accurately estimates the size of the maximum clique in the graph and performs the sorting of the vertices, in such a way that the vertices that are not exactly in the maximum clique can be rejected. Procedure A, in fact, finds cliques of the maximum size in a given graph, using the procedure B. The main advantage of this method is that using it is expedient in real time for sufficiently large graphs, which in turn is important for the construction of control systems.

show abstract

Section: Methods Of Solving the Problemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%