Formalization and Classification of Combinatorial Optimization Problems

Leonid Hulianytskyi () and Iryna Riasna ()
Additional contact information
Leonid Hulianytskyi: V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine
Iryna Riasna: V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine

A chapter in Optimization Methods and Applications, 2017, pp 239-250 from Springer

Abstract: Abstract Original approach to determination of the concepts “combinatorial object” and “fuzzy combinatorial object” is offered, which allows to strictly formalize both the known and new classes of problems of combinatorial optimization. The offered approach to such formalization which is concept-based a local finiteness of the discrete spaces relies only on properties of the discrete spaces therefore has quite general character and allows to develop the constructive approach to creation of special objects in combinatorial spaces. The obtained results are important both in the theoretical plan and for development of methods of solving the combinatorial optimization problems.

Date: 2017
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-3-319-68640-0_11

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

DOI: 10.1007/978-3-319-68640-0_11

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 ().