Approximation Algorithms and Semidefinite Programming
Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexit...
Κύριοι συγγραφείς: | Gärtner, Bernd (Συγγραφέας), Matousek, Jiri (Συγγραφέας) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2012.
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Aspects of Semidefinite Programming Interior Point Algorithms and Selected Applications /
ανά: Klerk, Etienne de
Έκδοση: (2002) -
Exact Exponential Algorithms
ανά: Fomin, Fedor V., κ.ά.
Έκδοση: (2010) -
Combinatorial Optimization 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers /
Έκδοση: (2016) -
Theoretical Aspects of Local Search
ανά: Michiels, Wil, κ.ά.
Έκδοση: (2007) -
Evolutionary Computation in Combinatorial Optimization 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings /
Έκδοση: (2004)