Skip to main content

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 72))

  • 664 Accesses

Abstract

Results of investigations of problems of solving complicated combinatorial problems are analyzed. An analysis of problems arising in graph theory occupies a considerable place. Prospects are shown for the combined application of results of graph theory and modern optimization methods to the investigation and solution of complicated mathematical problems.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Belan, E.P., Mikhalevich, M.V., Sergienko, I.V.: Cycles in economic systems with open labor markets. Cybern. Syst. Anal. 44(4), 48–72 (2008)

    Article  MathSciNet  Google Scholar 

  2. Voevodin, V.V.: Mathematical Models and Methods in Parallel Processes [in Russian]. Nauka, Moscow (1986)

    Google Scholar 

  3. Donets, G.A.: Solution of the safe problem on (0,1)-matrices. Cybern. Syst. Anal. 38(1), 83–88 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Donets, G.A.: Solution of a matrix problem on a mathematical safe for locks of the same kind. Cybern. Syst. Anal. 41(2), 289–301 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Donets, G.A., Kolechkina, L.N.: Method of ordering the values of a linear function on a set of permutations. Cybern. Syst. Anal. 45(2), 204–213 (2009)

    Article  MathSciNet  Google Scholar 

  6. Donets, G.A., Ya, A.: Petrenyuk, Extremal Graph Covers [in Russian]. Combinatorni Konfiguratsii, Kirovograd (2009)

    Google Scholar 

  7. Donets, G.A., Shulinok, I.E.: “Estimating the complexity of algorithms for natural modular graphs,” Teoriya Optimal’nykh Reshenii. V. M. Glushkov Institute of Cybernetics NАS Ukraine. 4, 61–68 (2001)

    Google Scholar 

  8. Mikhalevich, V.S., Rybal’skii, V.I.: Computer Design Principles for Optimal Terms and Priority in Construction [in Russian]. Akad. Stroit. Arkhitekt. SSSR, Kyiv (1962)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media New York

About this chapter

Cite this chapter

Sergienko, I.V. (2012). Analyzing the Solution of Complicated Combinatorial Problems. In: Methods of Optimization and Systems Analysis for Problems of Transcomputational Complexity. Springer Optimization and Its Applications, vol 72. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4211-0_5

Download citation

Publish with us

Policies and ethics