求解 Steiner树对通信网络点对多点路由优化问题有重要意义 ,已被证明是 NP- complete的 .通过把图形简化技术、进化规划方法和 KM......

DNA computing is a novel method for solving a class of intractable computational problem,in which the computing can grow......

Partner selection is a fundamental problem in the formation and success of a virtual enterprise. The partner selection p......

Constraint-based multicast routing, which aims at identifying a path that satisfies a set of quality of service (QoS) co......

A new model for the well-known problem, the satisfiablility problem of boolean formula (SAT), is introduced. Based on th......

The knapsack problem is well known to be NP-complete. Due to its importance in cryptosystem and in number theory, in the......

Tradeoffs between time complexities and solution optimalities are important when selecting algorithms for an NP-hard pro......