A Method for Modeling the Structure of Initial Data and Subclasses of Solvable Combinatorial Optimization Problems

  • Authors:

  • G. A. Donets;I. V. Sergienko

  • Affiliations:

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

  • Venue:
  • Cybernetics and Systems Analysis
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

A class of polynomially solvable problems of combinatorial optimization is illustrated by the example of the traveling salesman problem. It is proved that this class includes problems for which the structure of initial data is specially modeled.