Ranked solutions to a class of combinato
β
Timothy P. Doerr; Gelio Alves; Yi-Kuo Yu
π
Article
π
2005
π
Elsevier Science
π
English
β 400 KB
Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time using the transfer matrix technique or, equivalently, the dynamic programming approach. This suggests a way to efficiently