Exact algorithms for generalized combinatorial optimization problemsc

被引:0
|
作者
Pop, Petrica C. [1 ]
Sitar, Corina Pop [2 ]
Zelina, Ioana [1 ]
Tascu, Ioana [1 ]
机构
[1] North Univ Baia, Fac Sci, Dept Math & Comp Sci, Baia Mare, Romania
[2] North Univ Baia Mare, Dept Econ, Fac Studies, Baia Mare, Romania
关键词
generalized combinatorial optimization problems; exact algorithms; dynamic programming;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:154 / +
页数:3
相关论文
共 50 条