January 2022
Intermediate to advanced
1196 pages
25h 39m
English
In computer science and mathematical optimization, a heuristic is a procedure designed to find a good enough solution to an optimization problem when the classical methods (LP, QP, SOCP, SDP, SQP) that we discussed in the past few chapters fail, are too slow, are infeasible, or are not applicable. This is especially true when the problem is too big (e.g., beyond the limited computation capacity), have incomplete or imperfect information (e.g., lack of structure for pruning), have a complex objective function (e.g., nondifferentiable), or have difficult constraints (rule-based constraints, exceptions). ...
Read now
Unlock full access