Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
Optimization problems in practice are diverse and evolve over time, giving rise to - quirements both for ready-to-use optimization software packages and for optimization software libraries, which provide more or less adaptable building blocks for app- cation-specific software systems. In order to apply optimization methods to a new type of problem, corresponding models and algorithms have to be “coded” so that they are accessible to a computer. One way to achieve this step is the use of a mod- ing language. Such modeling systems provide an excellent interface between models and solvers, but only for a limited range of model types (in some cases, for example, linear) due, in part, to limitations imposed by the solvers. Furthermore, while m- eling systems especially for heuristic search are an active research topic, it is still an open question as to whether such an approach may be generally successful. Modeling languages treat the solvers as a “black box” with numerous controls. Due to variations, for example, with respect to the pursued objective or specific problem properties, - dressing real-world problems often requires special purpose methods. Thus, we are faced with the difficulty of efficiently adapting and applying appropriate methods to these problems. Optimization software libraries are intended to make it relatively easy and cost effective to incorporate advanced planning methods in application-specific software systems. A general classification provides a distinction between callable packages, nume- cal libraries, and component libraries.
1. Optimization Software Class Libraries; S. Voß, D.L. Woodruff.
2. Distribution, Cooperation, and Hybridization for Combinatorial Optimization; M.S. Jones, et al.
3. A Framework for Local Search Heuristics for Combinatorial Optimization Problems; A.A. Andreatta, et al.
4. HotFrame: A Heuristic Optimization Framework; A. Fink, S. Voß.
5. Writing Local Search Algorithms Using EasyLocal++; L. Di Gaspero, A. Schaerf.
6. Integrating Heuristic Search and One-Way Constraints in the iOpt Toolkit; C. Voudouris, R. Dorne.
7. The OptQuest Callable Library; M. Laguna, R. Martí.
8. A Constraint Programming Toolkit for Local Search; P. Shaw, et al.
9. The Modeling Language OPL - A Short Overview; P. Van Hentenryck, L. Michel.
10. Genetic Algorithm Optimization Software Class Libraries; A.R. Pain, C.R. Reeves.
Abbreviations. References. Index.