Heuristic techniques

Williams, J.F. (1981) Heuristic techniques for simultaneous scheduling of production and distribution in multi-echelon structures. Management Science, 27, 336. 

C. R. Reeves, Ed., Modern Heuristic Techniques For Combinatorial Problems, Blackwell... 

Quite a variety of different methods can and have been apphed in QSAR work for the evaluation of classification rules [74]. These methods may roughly be divided into two categories, namely parametric or statistical and non-parametric or heuristic techniques. While class separation in the parametric techniques is... 

Reeves, C. R. (1993), Modem Heuristic Techniques in Combinatorial Problems, Halsted Press, New York. 

Heuristic techniques or fimction approximations (i.e., the secant method) can be exploited when the fimction is monotone. 

This combinatorial optimization problem is typically referred to as redundancy optimization problem (Ushakov 1987). Some generalizations, considering different versions of the network elements with different costs, are available (Levitin et al. 1998). Typical approaches to solve the Problem 21 are based on some heuristic techniques, such as Genetic Algorithms, among others (Lisniansky and Levitin 2003). 

W. Geurts, F. Catthoor, H. De Man. Heuristic techniques for the synthesis of complex functional units. In Proc. of 4th European Design Automation Conf. Paris, France, Feb 1993. 

A fundamental paper on the topics can be considered that one by Yang D.C.H. and Lee T.W., [2], in which the optimization problem has been formulated through a Volume Index on workspace and by using successfully a heuristic technique, developed in the communications field. 

Many applications in computational chemistry have a search space that is exponentially proportional to the problem dimensions and but for the simplest of cases these problems cannot be solved using exhaustive search methods. Consequently. there is considerable interest in heuristic techniques that attempt to discover near-optimal solutions within an... 

The normative category involve these approaches whose main goal is the optimization or improvement mathematical programming models and heuristic techniques. 

---