Cargando…
Complexity and approximation: combinatorial optimization problems and their approximability properties
Autor principal: | Ausiello, G |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
1999
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/1434396 |
Ejemplares similares
-
Approximation and complexity in numerical optimization: continuous and discrete problems
por: Pardalos, Panos
Publicado: (2000) -
On Approximability of Minimum Bisection and Related Partition Problems
por: Karpinski, M
Publicado: (2003) -
On the problem of the bound states in the framework of the Padé approximants
por: Caneschi, L, et al.
Publicado: (1969) -
Neural approximations for optimal control and decision
por: Zoppoli, Riccardo, et al.
Publicado: (2019) -
Complexity and approximation: in memory of Ker-I Ko
por: Du, Ding-Zhu, et al.
Publicado: (2020)