Combinatorial and Global Optimization.
Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous u...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | |
Otros Autores: | , |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Singapore :
World Scientific Publishing Company,
2002.
|
Colección: | Series on applied mathematics.
|
Temas: | |
Acceso en línea: | Texto completo |
Sumario: | Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated. |
---|---|
Descripción Física: | 1 online resource (372 pages) |
Bibliografía: | Includes bibliographical references. |
ISBN: | 9789812778215 9812778217 |