Cargando…
Polyhedral and semidefinite programming methods in combinatorial optimization
Since the early 1960s, polyhedral methods have played a central role in both the theory and practice of combinatorial optimization. Since the early 1990s, a new technique, semidefinite programming, has been increasingly applied to some combinatorial optimization problems. The semidefinite programmin...
| Autor principal: | |
|---|---|
| Lenguaje: | eng |
| Publicado: |
American Mathematical Society
2010
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/2264203 |