Subclasses of solvable problems from classes of combinatorial optimization problems

DOI10.1007/s10559-009-9088-2zbMath1178.90298OpenAlexW1988621216MaRDI QIDQ1040379

N. K. Timofeeva

Publication date: 24 November 2009

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-009-9088-2

zbMATH Keywords

combinatorial optimizationcombinatorial configurationsolvable problemsobjective and combinatorial functions

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Extreme Hamiltonian lines
• Pyramidal tours and the traveling salesman problem
• Approach to finding the optimal solution in the assignment problem
• Recognition of fractal graphs
• Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
• Perspectives of Monge properties in optimization
• Solvable cases of a new combinatorial problem of optimization
• Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices
• On the symmetric traveling salesman problem
• Conic characterization of Monge matrices
• The asymptotic probabilistic behaviour of quadratic sum assignment problems
• On the cycles generated by an arbitrary set of matrix elements
• The traveling salesman problem in graphs with 3-edge cutsets
• On Testing Convexity and Submodularity
• Solving nonconvex planar location problems by finite dominating sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subclasses of solvable problems from classes of combinatorial optimization problems