Abstract
We discuss fast exponential time exact algorithms for generalized combinatorial optimization problems. The list of discussed NPcomplete generalized combinatorial optimization problems includes the generalized minimum spanning tree problem, the generalized subset assignment problem and the generalized travelling salesman problem. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Pop, P. C., Sitar, C. P., Zelina, I., & Taşcu, I. (2007). Exact algorithms for generalized combinatorial optimization problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4616 LNCS, pp. 154–162). Springer Verlag. https://doi.org/10.1007/978-3-540-73556-4_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
