Analyzing the Solution of Complicated Combinatorial Problems

Ivan V. Sergienko
Additional contact information
Ivan V. Sergienko: National Academy of Sciences of Ukraine

Chapter Chapter 5 in Methods of Optimization and Systems Analysis for Problems of Transcomputational Complexity, 2012, pp 187-210 from Springer

Abstract: 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.

Keywords: Power Plant; Thermal Power Plant; Hamiltonian Path; Network Graph; Complex Image (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-4211-0_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461442110

DOI: 10.1007/978-1-4614-4211-0_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().