Network model for the problem of integer balancing of a four-dimensional matrix

A. V. Smirnov

Modelirovanie i analiz informacionnyh sistem, Tome 23 (2016) no. 4, pp. 466-478

Résumé

The problem of integer balancing of a four-dimensional matrix is studied. The elements of the inner part (all four indices are greater than zero) of the given real matrix are summed in each direction and each two- and three-dimensional section of the matrix; the total sum is also found. These sums are placed into the elements where one or more indices are equal to zero (according to the summing directions). The problem is to find an integer matrix of the same structure, which can be produced from the initial one by replacing the elements with the largest previous or the smallest following integer. At the same time, the element with four zero indices should be produced with standard rules of rounding-off. In the article the problem of finding the maximum multiple flow in the network of any natural multiplicity $k$ is also studied. There are arcs of three types: ordinary arcs, multiple arcs and multi-arcs. Each multiple and multi-arc is a union of $k$ linked arcs, which are adjusted with each other. The network constructing rules are described. The definitions of a divisible network and some associated subjects are stated. There are defined the basic principles for reducing the integer balancing problem of an $l$-dimensional matrix ($l\geq3$) to the problem of finding the maximum flow in a divisible multiple network of multiplicity $k$. There are stated the rules for reducing the four-dimensional balancing problem to the maximum flow problem in the network of multiplicity 5. The algorithm of finding the maximum flow, which meets the solvability conditions for the integer balancing problem, is formulated for such a network.

Détail

Keywords: integer balancing, multiple networks, multiple flows, divisible networks, $NP$-completeness, generalized labeling algorithm
Mots-clés : four-dimensional matrices.

Bibliographie

[1] Korbut A. A., Finkelstein J. J., Diskretnoe programmirovanie, Nauka, M., 1969 (in Russian) | MR

[2] Raskin L. G., Kirichenko I. O., Mnogoindeksnye zadachi lineynogo programmirovaniya, Radio i svyaz, M., 1982 (in Russian) | MR

[3] Spieksma F. C. R., “Multi index assignment problems: complexity, approximation, applications”, Nonlinear Assignment Problems. Algorithms and Applications, eds. P. M. Pardalos, L. S. Pitsoulis, Kluwer Academic Publishers, 2000, 1–11 | DOI | MR

[4] Afraimovich L. G., “Three-index linear programs with nested structure”, Automation and Remote Control, 72:8 (2011), 1679–1689 | DOI | MR | Zbl

[5] Kondakov A. S., Roublev V. S., “Zadacha sbalansirovaniya matritsy plana”, Doklady Odesskogo seminara po diskretnoy matematike, 2, Astroprint, Odessa, 2005, 24–26 (in Russian)

[6] Korshunova N. M., Roublev V. S., “Zadacha tselochislennogo sbalansirovaniya matritsy”, Sovremennye problemy matematiki i informatiki, 3, Yaroslavl State University, Yaroslavl, 2000, 145–150 (in Russian)

[7] Ford L. R., Fulkerson D. R., Flows in Networks, Princeton University Press, 1962 | MR | Zbl

[8] Roublev V. S., Smirnov A. V., “$NP$-Completeness of the Integer Balancing Problem for a Three-Dimensional Matrix”, Doklady Mathematics, 82:3 (2010), 912–914 | DOI | MR | Zbl

[9] Garey M. R., Johnson D. S., Computers and Intractability: A Guide to the Theory of $NP$-Completeness, W. H. Freeman, 1979 | MR | Zbl

[10] Karp R., “Reducibility among combinatorial problems”, Complexity of Computer Computations, eds. R. E. Miller, J. W. Thatcher, Plenum, 1972, 85–103 | DOI | MR

[11] Roublev V. S., Smirnov A. V., “The Problem of Integer-Valued Balancing of a Three-Dimensional Matrix and Algorithms of Its Solution”, Modeling and Analysis of Information Systems, 17:2 (2010), 72–98 (in Russian)

[12] Smirnov A. V., “Some Solvability Classes for the Problem of Integer Balancing of a Three-Dimensional Matrix with Constraints of the Second Type”, Automatic Control and Computer Sciences, 48:7 (2014), 543–553 | DOI

[13] Smirnov A. V., “Heuristic Algorithms for the Problem of Integer Balancing of a Three-Dimensional Matrix with Constraints of the Second Type”, Automatic Control and Computer Sciences, 49:7 (2015), 473–483 | DOI

[14] Smirnov A. V., “The Problem of Finding the Maximal Multiple Flow in the Divisible Network and its Special Cases”, Modeling and Analysis of Information Systems, 22:4 (2015), 533–545 (in Russian) | MR

[15] Rublev V. S., Smirnov A. V., “Flows in Multiple Networks”, Yaroslavsky Pedagogichesky Vestnik, 3:2 (2011), 60–68 (in Russian)