E-bok, Engelska, 2002
Combinatorial And Global Optimization
Av Pardalos Panos M Pardalos, Migdalas Athanasios Migdalas, Burkard Rainer E Burkard
774 kr
Läs direkt i Bokus Reader – eller ladda ned till din enhet (PDF kräver ofta zoom och scroll på små skärmar).
Fler format och utgåvor
Beskrivning
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.
Produktinformation
- Utgivningsdatum: 2002-04-05
- Språk: Engelska
- Antal sidor: 372
- Filformat: PDF
- Kopieringsskydd: LCP
- ISBN: 9789814489652
- Förlag: World Scientific Publishing Company
Utforska kategorier
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.