A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems

DOI10.1007/s10559-014-9587-7zbMath1298.90083OpenAlexW2010262521MaRDI QIDQ466000

Ivan V. Sergienko, Georg A. Donets

Publication date: 24 October 2014

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

Full work available at URL: https://doi.org/10.1007/s10559-014-9587-7

zbMATH Keywords

combinatorial optimizationtraveling salesman problempolynomial algorithmassignment problemintractable problemNP-complete problemDemidenkoKalmansonmatrix of SupnikMongesolvable subclass of problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

A method to solve conditional optimization problems with quadratic objective functions on the set of permutations ⋮ Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems