Article
Математическое моделирование и оптимизация бизнес-процессов на основе комплексного критерия «шансы — риски
Российский журнал менеджмента. 2015. Т. 13. № 4. С. 51-68.
Мадера А. Г.
Similar publications
Грачева С. С., Късовска С. В. В кн.: Математико-статистический анализ социально-экономических процессов. Межвузовский сборник научных трудов. Выпуск 10. Вып. 10. М.: МЭСИ, 2013. С. 29-33.
Added: Feb 25, 2014
Кофанов Ю. Н. М.: Энергоатомиздат, 2011.
Added: Apr 18, 2012
Added: Apr 16, 2012
Тангян А. Математические методы анализа решений в экономике, бизнесе и политике. WP7. Высшая школа экономики, 2006. No. 03.
Added: Mar 23, 2013
Current article contains the analysis of optimization tasks of investment recourses for project implementation of new routes for urban transport. It is assumed that a limited amount of funds used to purchase vehicles needed for new routes. To solve the problem we use economical and mathematical modeling.
Added: Jun 19, 2012
In this paper, we consider the problem of maximizing total tardiness on a single machine, where the first job starts at time zero and idle times between the processing of jobs are not allowed. We present a modification of an exact pseudo-polynomial algorithm based on a graphical approach, which has a polynomial running time.
Added: Mar 4, 2013
Авдеев Д. К., Егоров С. А., Жаднов В. В. и др. В кн.: Радиовысотометрия - 2010: Сборник трудов Третьей Всероссийской научно-технической конференции. Екатеринбург: ООО «Форт Диалог-Исеть», 2010. С. 154-156.
Added: Jan 25, 2013
In this paper, we present a modification of dynamic programming algorithms (DPA), which we denote as graphical algorithms (GrA). For the knapsack problem and some single machine scheduling problems, it is shown that the time complexity of the GrA is less that the time complexity of the standard DPA. Moreover, the average running time of the GrA is often essentially smaller. A GrA can also solve largescale instances and instances, where the parameters are not integer. In addition, for some problems, GrA has a polynomial time complexity in contrast to a pseudo-polynomial complexity of DPA.
Added: Mar 4, 2013
Added: Apr 12, 2012