Exact algorithms for generalized combinatorial optimization problems

Authors:
Petrica C. Pop;Corina Pop Sitar;Ioana Zelina;Ioana Taşcu
Affiliations:
Department of Mathematics and Computer Science, Faculty of Sciences, North University of Baia Mare, Romania;Department of Economics, Faculty of Sciences, North University of Baia Mare, Romania;Department of Mathematics and Computer Science, Faculty of Sciences, North University of Baia Mare, Romania;Department of Mathematics and Computer Science, Faculty of Sciences, North University of Baia Mare, Romania
Venue:
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Year:
2007

Citing 2
Cited 1

A multiplier adjustment method for the generalized assignment problem

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

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

Parameterized algorithms for generalized traveling salesman problems in road networks

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss fast exponential time exact algorithms for generalized combinatorial optimization problems. The list of discussed NP-complete generalized combinatorial optimization problems includes the generalized minimum spanning tree problem, the generalized subset assignment problem and the generalized travelling salesman problem.