Mathematical Programming Solver Based on Local Search
Book information
Description
This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kin. �Read more... Abstract: This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kin
Similar books
Методы оптимизации распределительных процессов
DJVU
Основы теории оптимизации (постановки задач)
Введение в методы оптимизации
EPUB
Введение в методы оптимизации
Введение в методы оптимизации
DJVU
Combinatorial Data Analysis. Optimization by Dynamic Programming
Setvalued Optimization: An Introduction with Applications