Two NP-hard interchangeable terminal problems.
Sartaj K. SahniSan-Yuan WuPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1988)
Keyphrases
- np hard
- np hardness
- np complete
- neural network
- difficult problems
- decision problems
- special case
- lower bound
- solving problems
- databases
- probabilistic model
- linear programming
- benchmark problems
- integer programming
- practical problems
- machine learning
- approximate solutions
- computational problems
- computationally challenging