Browse Dept. of Industrial and Enterprise Systems Engineering by Subject "Non-deterministic Polynomial-time hard (NP-hard) problems"
Now showing items 1-1 of 1
(2013-08-22)Semidefinite relaxation (SDR) is a powerful tool to estimate bounds and obtain approximate solutions for NP-hard problems. This thesis introduces and studies several novel linear and nonlinear semidefinite relaxation models ...