Combinatorial and global optimization (Series on applied mathematics-vol. 14)

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...

Celý popis

Uložené v:
Podrobná bibliografia
Hlavní autori: Pardalos, Panos M, Migdalas, Athanasios, Burkard, Rainer E
Médium: E-kniha Kniha
Jazyk:English
Vydavateľské údaje: New Jersey ; Singapore World Scientific Publishing Co. Pte. Ltd 2002
World Scientific
World Scientific Publishing Company
WORLD SCIENTIFIC
World Scientific Publishing
Vydanie:1
Edícia:Series on applied mathematics
Predmet:
Artificial Intelligence (Machine Learning, Neural Networks, Fuzzy Logic)
Combinatorial optimization
Combinatorial optimization > Congresses
Congresses
Mathematical optimization
Mathematical optimization > Congresses
MATHEMATICS
Nonlinear programming
Nonlinear programming > Congresses
Numerical Analysis And Computational Mathematics
Combinatorial Optimization
Global Optimization
ISBN:9810248024, 9789810248024, 9789812778215, 9812778217, 9789814489652, 9814489654
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 Goemans-Williamson relaxation of the maximum cut problem, and the Du-Hwang solution of the Gilbert-Pollak conjecture. Since integer constraints are equivalent to nonconvex constraints, the fundamental difference between classes of optimization problems is not between discrete and continuous problems but between convex and nonconvex optimization problems. This volume is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete, Greece.
Bibliografia:Includes bibliographical references
ISBN:9810248024
9789810248024
9789812778215
9812778217
9789814489652
9814489654
DOI:10.1142/4856