?
Tool for Simulating Branch and Bound Computations
Open Computer Science. 2020. Vol. 10. No. 1. P. 112-116.
Ignatov A., Andrei Gorchakov
The paper describes a simulator of parallel Branch and Bound (BnB) method. Several subdomain trees for benchmark functions are analyzed, a characteristic Gaussian-like distribution is discovered. An algorithm of artificial tree generation is formulated according to this criterion. The process of simulator modeling is described, several computational experiments are conducted. Their results show a hyperbolic decrease trend for modeled time as the number of computational units grows, which is concluded to be similar to real systems.
Priority areas:
IT and mathematics
Language:
English
Lazarev A. A., Musatova E. G., Kvaratskhelia A. et al., М. : Физический факультет МГУ, 2012
Данное учебное пособие посвящено задачам теории расписаний, возникающим на транспорте. Представлены основы теории расписаний, а также способы построения моделей и методы решения задач управления транспортными системами. Изложенный материал предназначен для студентов и преподавателей вузов математических специальностей, специалистов в области управления и практиков, занимающихся решением задач планирования грузовых перевозок. ...
Added: December 10, 2012
Aldunin D. A., Fedin G., Информационные технологии 2019 Т. 25 № 4 С. 250-256
Distant learning has weaknesses related to missing tutor and kind of autodidacticism of the process, which may cause learner’s frustration in uncertain situations and force him or her to drop the learning course. Inasmuch as it is very important to help learner to select a set of needed courses, the article deals with the task ...
Added: September 18, 2019
Switzerland : Springer, 2015
Recent developments in theory, algorithms, and applications in optimization and control are discussed in this proceedings, based on selected talks from the ‘Optimization Control and Applications in the Information Age’ conference, organized in honor of Panos Pardalos’s 60th birthday. This volume contains numerous applications to optimal decision making in energy production and fuel management, data ...
Added: September 13, 2015
Кибзун А. И., Panarin S. I., Вестник компьютерных и информационных технологий 2010 № 12 С. 31-40
The stochastic model is provided. Using the model, redesign of distance learning system CLASS.NET is done by solving the stochastic optimization problem. ...
Added: December 5, 2013
Kuznetsov V. O., Логистика и управление цепями поставок 2018 № 1 (84) С. 32-39
On the one hand, the relevance of this research is determined by an attempt of solving the problem of optimal inventory allocation, which can open the possibilities for increase in stock turnover. On the other hand, there was an attempt to extend the list of problems which can be solved by operations research methods. The ...
Added: November 29, 2018
Lazarev A. A., Gafarov E., М. : Физический факультет МГУ, 2011
В данном учебном пособии приводятся базовые сведения о специальном разделе дискретной математики - Теории расписаний. Описаны этапы становления теории, свойства и классификации задач теории расписаний, методы их решения. На примерах классических задач представлены приемы доказательства их трудоемкости и алгоритмы решения. Учебное пособие основано на курсе лекций, читаемых в МФТИ, МГУ и ВШЭ, и предназначено для ...
Added: December 10, 2012
Marshirova L. E., Marshirov V. V., Экономический анализ: теория и практика 2015 № 48 С. 13-24
Importance. Unincorporated entrepreneurship is rather widespread, however, interesting business ideas often die because entrepreneurs have poor knowledge of legislation, are not competent in tax planning and, as a consequence, suffer losses and go bankrupt. Therefore, choosing a taxation system is of great significance and practical use for individual entrepreneurs.
Objectives. The study aims to develop a ...
Added: January 26, 2016
Zhukova G., Ulyanov M., Fomichev M., Automation and Remote Control 2019 Vol. 80 No. 11 P. 2054-2067
We present the results of a comparative statistical analysis of the time for solving the asymmetric traveling salesman problem (ATSP) with the branch-and-bound method (without precalculation of the tour) and with a hybrid method. The hybrid method consists of the Lin–Kernighan–Helsgaun approximate algorithm used to calculate the initial tour and the branch-and-bound method. We show ...
Added: November 24, 2019
Lazarev A. A., Kvaratskhelia A., Gafarov E., Доклады Академии наук 2007 Т. 412 № 6 С. 739-742
27.47.19 Исследование операций
28.15.19 Нелинейные детерминированные системы
28.19.15 Оптимальные системы
28.29.15 Методы исследования операций ...
Added: November 23, 2012
Toporkov V., Anna Toporkova, Tselishchev A. et al., Procedia Computer Science 2015 Vol. 51 No. 1 P. 845-854
Distributed environments with the decoupling of users from resource providers are generally termed as utility Grids. The paper focuses on the problems of efficient job flow distribution and scheduling in virtual organizations (VOs) of utility Grids while ensuring the VO stakeholders preferences and providing dependable strategies for resources utilization. An approach based on the combination ...
Added: June 1, 2015
Ignatov A., Posypkin M., Communications in Computer and Information Science 2018 P. 511-522
The paper proposes an implementation of the Branch-and-Bound method for an enterprise grid based on the BOINC infrastructure. The load distribution strategy and the overall structure of the developed system are described with special attention payed to some specific issues such as incumbent updating and load distribution. The implemented system was experimentally tested on a ...
Added: October 18, 2019
Lazarev A. A., Kvaratskhelia A., Автоматика и телемеханика 2010 № 10 С. 80-89
In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine. This problem is known to be open. Here, we give some properties of optimal schedules for the problem and its special cases. ...
Added: November 24, 2012
M. : [б.и.], 2018
Book include abstracts of reports presented at the IX International Conference on Optimization Methods and Applications "Optimization and applications" (OPTIMA-2018) held in Petrovac, Montenegro, October 1 - October 5, 2018. ...
Added: October 9, 2018
Springer, 2015
This book offers a wealth of interdisciplinary approaches to urbanization strategies in architecture centered on growing concerns about the future of cities and their impacts on essential elements of architectural optimization, livability, energy consumption and sustainability. It portrays the urban condition in architectural terms, as well as the living condition in human terms, both of ...
Added: April 13, 2015
Batsyn M.V., Kalyagin V.A., Tulyakov D. N., / Институт прикладной математики им. М.В. Келдыша Российской академии наук. 2015. No. 91.
The Protein Structure Alignment Problem (PSAP) consists in finding the
best alignment of two proteins defined by their primary structures. It finds
the most similar substructure of two proteins. This problem is polynomially
reducible to the Maximum Clique Problem (MCP) for the protein alignment
graph. In this paper we present an efficient algorithm for the PSAP based on
our recent ...
Added: October 24, 2016
Maxim Babenko, Goldberg A., Gupta A. et al., Lecture Notes in Computer Science 2013 Vol. 7965 No. PART 1 P. 69-80
Cohen et al. developed an O(log n)-approximation algorithm for minimizing the total hub label size (l1 norm). We give O(log n)- approximation algorithms for the problems of minimizing the maximum label (l∞ norm) and minimizing lp and lq norms simultaneously. ...
Added: November 13, 2013
Lazarev A. A., Журнал вычислительной математики и математической физики 2007 Т. 47 № 6 С. 1087-1099
The classical NP-hard (in the ordinary sense) problem of scheduling jobs in order to minimize the total tardiness for a single machine 1‖ΣT j is considered. An NP-hard instance of the problem is completely analyzed. A procedure for partitioning the initial set of jobs into subsets is proposed. Algorithms are constructed for finding ...
Added: November 23, 2012
Gafarov E., Lazarev A. A., Werner F., Mathematical Social Sciences 2011 No. 62 P. 7-13
We consider single machine scheduling problems with a non-renewable resource. These types of problems have not been intensively investigated in the literature so far. For several problems of these types with standard objective functions (namely the minimization of makespan, total tardiness, number of tardy jobs, total completion time and maximum lateness), we present some complexity ...
Added: November 24, 2012
Gafarov E., Lazarev A. A., Information Processing Letters 2012 Т. 112 № 3 С. 72-76
In this note, we consider a single machine scheduling problem with generalized total tardiness objective function.
A pseudo-polynomial time solution algorithm is proposed for a special case of this problem. Moreover, we present a new
graphical algorithm for another special case, which corresponds to the classical problem of minimizing the weighted number
of tardy jobs on a single ...
Added: November 24, 2012
Guimarães R. R., Passos L., Filho R. H. et al., IEEE Network 2019 Vol. 33 No. 2 P. 126-131
Distinguishing outliers from normal data in wireless sensor networks has been a big challenge in the anomaly detection domain, mostly due to the nature of the anomalies, such as software or hardware failures, reading errors or malicious attacks, just to name a few. In this article, we introduce an anomaly detection-based OPF classifier in the ...
Added: December 19, 2018
Beklaryan L., Флерова А. Ю., Zhukova A., МФТИ, 2018
В основу данного учебного пособия включен материал практических занятий по курсам «Оптимизация» и «Методы оптимального управления». Представлены теоретические результаты, примеры применения и вопросы для самостоятельного изучения в области оптимизации. Рассмотрены задачи оптимального управления, подходы и методы их решения, в частности принцип максимума Понтрягина, необходимые и достаточные условия существования решения. Предназначено для студентов старших курсов, аспирантов, специалистов ...
Added: June 17, 2021
Gabeydulin R., Труды ГосНИИАС. Серия: Вопросы авионики 2018 № 2(35) С. 39-53
The paper presents a brief introduction to the air traffic flow management problem, describes main terms, rules and also describes the main approaches for solving the problem. Author describes how flow management systems work in Europe, USA and in the Russian Federation. Author proposes a fast greedy algorithm for solving flow management problem defined in ...
Added: March 22, 2018
Lazarev A. A., Gafarov E., Доклады Академии наук 2008 Т. 424 № 1 С. 7-9
27.47.19 Исследование операций
28.15.19 Нелинейные детерминированные системы
28.19.15 Оптимальные системы
28.29.15 Методы исследования операций ...
Added: November 23, 2012
Sotnikova S., Динамика сложных систем 2012 № 3 С. 84-87
In article is described designed programme complex of the physical processes modeling, which also allows to conduct the identification printed node parameters (the physical model). On printed node designed the on-board secondary power supply source is realized. For it are designed relationship interfaces of controlling program with the known program of modeling and optimization. ...
Added: December 5, 2014