EPUBof these approaches is provided in Sect. 3.6 . 3.6 Methods The available techniques for solving optimization problems can be roughly classified into three main categories: exact , approximation , and heuristic methods. While exact methods allow to find solutions with theoretical guarantees, their run-time increases dramatically with the instance size. Heuristic approaches, on the other side, sacrifice optimality guarantees to find solutions in a more efficient way, by spending only a “reasonable” amount of time to compute them. Unlike heuristics, where there is no knowledge of the quality of the solution returned, approximation methods provide solutions within a small constant factor of the optimal solution. The combination of these approaches defines the category of hybrid methods . 3.6.1 Exact Methods Exact methods have the advantage of guaranteed quality of the solution but the computational demand of such methods can be exponential in the worst case, and, in practice, often only moderately sized instances can be solved to optimality. Exact methods include a wide variety of techniques, such as Branch-and-Bound[ 13 ], Branch-and-Cut [ 19 ], Branch-and-Price [ 2 ], and Bayesian Optimization [ 28 ]. Nevertheless, in general finding an optimal solution is an intractable problem; although many results of mathematical analysis assure the presence of global optimizers for many problems, it is common to face real-world applications where exact methods are not applicable, due to th
Rate this eBook
| File Name: | 9ba597ce62bcc4516f4ac3450192728c.epub |
| Original Title: | Optimization Approaches for Solving String Selection Problems |
| Creator / Author: | Elisa Pappalardo, Panos M. Pardalos and Giovanni Stracquadanio |
| Language: | English (en) |
| Identifier: | ASIN:175184 |
| Publisher: | Elisa Pappalardo, Panos M. Pardalos and Giovanni Stracquadanio Publishing |
| Category: | Fiction |
| Format: | 📗 EPUB eBook |
| File Size: | 3.5 MB |