Skip to main content
Log in

Network Model for the Problem of Integer Balancing of a Four-Dimensional Matrix

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

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 ≥ 3) 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Korbut, A.A. and Finkelstein, J.J., Diskretnoe programmirovanie (Discrete Programming), Nauka, 1969.

    MATH  Google Scholar 

  2. Raskin, L.G. and Kirichenko, I.O., Mnogoindeksnye zadachi lineynogo programmirovaniya (Multi-index Problems of Integer Programming), Radio i svyaz, 1982.

    MATH  Google Scholar 

  3. Spieksma, F.C.R., Multi index assignment problems: Complexity, approximation, applications, in Nonlinear Assignment Problems. Algorithms and Applications, Pardalos, P.M. and Pitsoulis, L.S., Eds., Kluwer Academic Publishers, 2000.

    Google Scholar 

  4. Afraimovich, L.G., Three-index linear programs with nested structure, Autom. Remote Control, 2011, vol. 72, no. 8, pp. 1679–1689.

    Article  MathSciNet  MATH  Google Scholar 

  5. Kondakov, A.S. and Roublev, V.S., The problem of balancing of a matrix plan, Proc. Odessa Seminar on Discrete Mathematics, Odessa, 2005, no. 2, pp. 24–26.

    Google Scholar 

  6. Korshunova, N.M. and Roublev, V.S., The problem of integer balancing of a matrix, in Sovremennye problemy matematiki i informatiki (Current Problems of Math and Computer Science), Yaroslavl, 2000, pp. 145–150

    Google Scholar 

  7. Ford, L.R. and Fulkerson, D.R., Flows in Networks, Princeton University Press, 1962.

    MATH  Google Scholar 

  8. Roublev, V.S. and Smirnov, A.V., N P-completeness of the integer balancing problem for a three-dimensional matrix, Dokl. Math., 2010, vol. 82, no. 3, pp. 912–914.

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  10. Karp, R., Reducibility among combinatorial problems, Complexity of Computer Computations, Miller, R.E. and Thatcher, J.W., Eds., Plenum, 1972, pp. 85–103

  11. Roublev, V.S. and Smirnov, A.V., The problem of integer-valued balancing of a three-dimensional matrix and algorithms of its solution, Model. Anal. Inf. Syst., 2010, vol. 17, no. 2, pp. 72–98.

    MATH  Google Scholar 

  12. Smirnov, A.V., Some solvability classes for the problem of integer balancing of a three-dimensional matrix with constraints of the second type, Autom. Control Comput. Sci., 2014, vol. 48, no. 7, pp. 543–553.

    Article  Google Scholar 

  13. Smirnov, A.V., Heuristic algorithms for the problem of integer balancing of a three-dimensional matrix with constraints of the second type, Autom. Control Comput. Sci., 2015, vol. 49, no. 7, pp. 473–483.

    Article  Google Scholar 

  14. Smirnov, A.V., The problem of finding the maximal multiple flow in the divisible network and its special cases, Model. Anal. Inf. Syst., 2015, vol. 22, no. 4, pp. 533–545.

    Article  Google Scholar 

  15. Rublev, V.S. and Smirnov, A.V., Flows in multiple networks, Yarosl. Pedagog. Vestn., 2011, vol. 3, no. 2, pp. 60–68.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. V. Smirnov.

Additional information

Published in Russian in Modelirovanie i Analiz Informatsionnykh Sistem, 2016, Vol. 23, No. 4, pp. 466–478.

The article was translated by the authors.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Smirnov, A.V. Network Model for the Problem of Integer Balancing of a Four-Dimensional Matrix. Aut. Control Comp. Sci. 51, 558–566 (2017). https://doi.org/10.3103/S0146411617070185

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411617070185

Keywords

Navigation