Subclasses of solvable problems from classes of combinatorial optimization problems |
| |
| Authors: | N. K. Timofeeva |
| |
| Affiliation: | (1) International Research and Training Center for Information Technologies and Systems, National Academy of Sciences of Ukraine and Ministry of Education and Science of Ukraine, Kyiv, Ukraine |
| |
| Abstract: | Well-known subclasses of solvable problems from classes of combinatorial optimization are reviewed. For solvable problems such as the traveling salesman problem, location problem, assignment problem, and clustering problem, the changes in the objective function on a given ordering of combinatorial configurations are analyzed. Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 97–105, March–April 2009. |
| |
| Keywords: | solvable problems combinatorial optimization combinatorial configuration objective and combinatorial functions |
| 本文献已被 SpringerLink 等数据库收录！ |
|
