You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 2 Next »

The root page 15DOTs60ia13:Tutorial could not be found in space 15.S60 SSIM: Software Tools for Operations Research.

Local Search

Suppose we are given some optimization problem

\[ \begin{aligned} &\min & f(\mathbf x)\\ &\text{subject to}& \mathbf x &\in S \end{aligned} \]

where \( S \subset \mathbb R^n \) and \( f \colon S \to \R \) . The idea of local search is as follows: for every \( \mathbf x \in S \) , define \( N_{\mathbf x} \) to be the neighborhood of \( \mathbf x \) .

  • No labels