Subclasses of solvable problems from classes of combinatorial optimization problems

Authors:
N. K. Timofeeva
Affiliations:
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
Venue:
Cybernetics and Systems Analysis
Year:
2009

Citing 9
Cited 0

The traveling salesman problem in graphs with 3-edge cutsets

Journal of the ACM (JACM)
On the cycles generated by an arbitrary set of matrix elements

USSR Computational Mathematics and Mathematical Physics
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Perspectives of Monge properties in optimization

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Solving Nonconvex Planar Location Problems by Finite Dominating Sets

Journal of Global Optimization
On Testing Convexity and Submodularity

SIAM Journal on Computing
Conic Characterization of Monge Matrices

Cybernetics and Systems Analysis
Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-monge matrices

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

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.