: ( ): Princeton University Press : 2012 : : Astrom K., Murray R. Feedback Systems: An Introduction for Scientists and Engineers. Princeton: Princeton University Press, 2012. 408 p. (http://press.princeton.edu/titles/8701.html) :
: ( ): John Wiley and Sons Ltd : 1985 : : Baker K., Kropp D. Management Science: Introduction to the Use of Decision Models. New York: John Wiley and Sons Ltd, 1985. 650 p. :
: : 2011 : : Foundations and Trends in Machine Learning () : 3(1) : Boyd S., Parikh N., Chu E., et al. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers // Foundations and Trends in Machine Learning. 2011. No. 3(1). P. 1 122. :
: : 2014 : : International Journal System of Systems Engineering () : 3 : 5 : Jaradat R., Keating C. A Histogram Analysis for System of Systems // International Journal System of Systems Engineering. 2014. Vol. 5. No. 3. P. 193 227. :
: ( ): Kraguevac University : 2015 : .. : MATCH Commun. Math. Comput. Chem. () : 74 (3) : M. Goubko, C. Magnant, P. Salehi Nowbandegani, I. Gutman. ABC Index of Trees with Fixed Number of Leaves, MATCH Commun. Math. Comput. Chem., V. 74, No 3. P. 697-701. : Given a graph G, the atom-bond connectivity (ABC) index is defined to be $ABC(G) = \sum_{uv\in E(G)} \sqrt{ \frac{ d_G(u) + d_G(v) - 2 }{d_G(u) d_G(v)} }$, where E(G) is the edge set of graph G and $d_G(v)$ is the degree of vertex v in graph G. The paper [C. Magnant, P. Salehi Nowbandegani, I. Gutman. Which tree has the smallest ABC index among trees with k leaves? Discrete Appl. Math., In Press.] claims to classify those trees with a fixed number of leaves which minimize the ABC index. Unfortunately, there is a gap in the proof leading to other examples that contradict the main result of that work. These examples and the problem are discussed in this work.
: ( ): Kraguevac University : 2016 : .. : MATCH Commun. Math. Comput. Chem. () : V. 75, No 1 : M. Goubko, Minimizing Wiener Index for Vertex-Weighted Trees with Given Weight and Degree Sequences, MATCH Commun. Math. Comput. Chem., 2016, V. 75, No 1, P. 3-27 : In 1997 Klavzar and Gutman suggested a generalization of the Wiener index to vertex-weighted graphs. We minimize the Wiener index over the set of trees with the given vertex weights' and degrees' sequences and show an optimal tree to be the, so-called, Huffman tree built in a bottom-up manner by sequentially connecting vertices of the least weights.
: ( ): Kraguevac University : 2016 : .. : MATCH Commun. Math. Comput. Chem. () : V. 75, No 1 : M. Goubko, O. Miloserdov: Simple Alcohols with the Lowest Normal Boiling Point Using Topological Indices, MATCH Commun. Math. Comput. Chem. 2016, V. 75, No 1 P. 29-56 : We find simple saturated alcohols with the given number of carbon atoms and the minimal normal boiling point. The boiling point is predicted with a weighted sum of the generalized first Zagreb index, the second Zagreb index, the Wiener index for vertex-weighted graphs, and a simple index caring for the degree of a carbon atom being incident to the hydroxyl group. To find extremal alcohol molecules we characterize chemical trees of order n, which minimize the sum of the second Zagreb index and the generalized first Zagreb index, and also build chemical trees, which minimize the Wiener index over all chemical trees with given vertex weights.
: ( ): Springer : 2016 : : in "New Frontiers in Information and Production Systems Modelling and Analysis Incentive Mechanisms, Competence Management, Knowledge-based Production Editors: Różewski, P., Novikov, D., Bakhtadze, N., Zaikin, O." : M. Goubko. Optimal Organizational Structures for Change Management in Production. in: "New Frontiers in Information and Production Systems Modelling and Analysis Incentive Mechanisms, Competence Management, Knowledge-based Production" (Ed.: Różewski, P., Novikov, D., Bakhtadze, N., Zaikin, O.) Springer, 2016. P. 59-83. : We consider a problem of a rational organizational structure for change management support being an important aspect of the strategic management process in a firm. We combine recent theoretical findings with experience in strategic consulting to suggest mathematical models of an organizational structure for change management based on a formal representation of a strategy of the firm and of available labor resources. The model of managers interactions employs an idea of linear duplication of efforts. The problem of an optimal organizational structure is reduced to an extremely complex mixed optimization problem. Then we attack a problem of an optimal organizational form (functional vs divisional vs matrix) for a special case of identical and symmetric projects of strategic development. We find span of control to be constant across the levels of an optimal functional, divisional, and matrix hierarchy, and directly compare costs of optimal organizational forms. A matrix organizational structure appears to be optimal when the number of projects and managerial functions is large enough, while matrix and divisional organizations are robust with respect to the project count increase.