Skip to main content
SpringerLink
Log in

Complexity of One Packing Optimization Problem

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The authors consider packing optimization for elements of a square matrix, which are given by positive integers, into blocks of fixed size. The problem is formulated and its combinatorial intractability is discussed. The problem is proved to be NP-complete. This is done by polynomial reduction of an NP-complete minimum-cost integer multicommodity flow problem to this problem.

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

Access this article

Log in via an institution

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. A. N. Trofimchuk and V. A. Vasyanin, “A technique to solve packing problem for the management of perspective development of communication network nodes,” Cybern. Syst. Analysis, 50, No. 4, 560–569 (2014).

    Article  MATH  Google Scholar 

  2. A. N. Trofimchuk and V. A. Vasyanin, “Simulation of packing, distribution, and routing of small-size discrete flows in a multicommodity network,” J. Autom. Inform. Sci., 47, No. 7, 15–30 (2015).

    Article  Google Scholar 

  3. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Series of Books in the Mathematical Sciences, W. H. Freeman (1979).

  4. S. Even, A. Itai, and A. Shamir, “On the complexity of timetable and multicommodity flow problems,” SIAM J. Comput., 5, 691–703 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  5. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Inc., Upper Saddle River (NJ) (1993).

  6. C. Barnhart, C. A. Hane, and P. H. Vange, “Using branch-and-price-and-cut to solve origin destination integer multicommodity flow problems,” Oper. Research, 48, No. 2, 318–326 (2000).

    Article  Google Scholar 

  7. C. Barnhart, N. Krishnan, and P. H. Vange, “Multicommodity flow problems,” in: C. A. Floudas and P. M. Pardalos (eds.), Encyclopedia of Optimization, Springer, New York (2009), pp. 2354–2362.

    Chapter  Google Scholar 

  8. V. A. Vasyanin, “A reference matrix of confluence of flows in packing optimization problems on multicommodity networks,” Syst. Doslidzh. ta Informats. Tekhnologii, No. 3, 42–49 (2014).

Download references

Author information

Authors and Affiliations

  1. Institute of Telecommunications and Global Information Space, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    O. M. Trofymchuk & V. A. Vasyanin

  2. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    V. N. Kuzmenko

Authors
  1. O. M. Trofymchuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Vasyanin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. N. Kuzmenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to O. M. Trofymchuk.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, January–February, 2016, pp. 83–92.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Trofymchuk, O.M., Vasyanin, V.A. & Kuzmenko, V.N. Complexity of One Packing Optimization Problem. Cybern Syst Anal 52, 76–84 (2016). https://doi.org/10.1007/s10559-016-9802-9

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-016-9802-9

Keywords

Search

Navigation