Combinatorial And Global Optimization
Rainer E Burkard · Athanasios Migdalas · Panos M Pardalos
apr. 2002 · Series On Applied Mathematics Bok 14 · World Scientific
E-bok
372
Sider
family_home
Kvalifisert
info
reportVurderinger og anmeldelser blir ikke kontrollert Finn ut mer
Om denne e-boken
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.
Vurder denne e-boken
Fortell oss hva du mener.
Hvordan lese innhold
Smarttelefoner og nettbrett
Installer Google Play Bøker-appen for Android og iPad/iPhone. Den synkroniseres automatisk med kontoen din og lar deg lese både med og uten nett – uansett hvor du er.
Datamaskiner
Du kan lytte til lydbøker du har kjøpt på Google Play, i nettleseren på datamaskinen din.
Lesebrett og andre enheter
For å lese på lesebrett som Kobo eReader må du laste ned en fil og overføre den til enheten din. Følg den detaljerte veiledningen i brukerstøtten for å overføre filene til støttede lesebrett.
