Approximation and complexity in numerical optimization : continuous and discrete problems /

There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems, from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continu...

Full description

Bibliographic Details

Corporate Author:	SpringerLink (Online service)
Other Authors:	Pardalos, P. M. (Panos M.), 1954- (Editor)
Format:	eBook
Language:	English
Published:	Dordrecht : Springer Science+Business Media, [2000]
Series:	Nonconvex optimization and its applications ; v. 42.
Subjects:	Mathematical optimization. Approximation theory. Computational complexity. Electronic books.
Online Access:	Connect to the full text of this electronic book