Sinossi
Computational complexity, originated from the interactions between computer science and numerical optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty.The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable.The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions.This book is a collection of articles on recent complexity developments in numerical optimization. The topics covered include complexity of approximation algorithms, new polynomial time algorithms for convex quadratic minimization, interior point algorithms, complexity issues regarding test generation of NP-hard problems, complexity of scheduling problems, min-max, fractional combinatorial optimization, fixed point computations and network flow problems.The collection of articles provide a broad spectrum of the direction in which research is going and help to elucidate the nature of computational complexity in optimization. The book will be a valuable source of information to faculty, students and researchers in numerical optimization and related areas.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Product Description
Book by None
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Complexity in Numerical Optimization
Foto dell'editore
COMPLEXITY IN NUMERICAL OPTIMIZATION
Editore:
World Scientific Publishing Comp, 1993
ISBN 10: 9810214154
ISBN 13: 9789810214159
Antico o usato
Rilegato
Da: suffolkbooks, Center moriches, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
hardcover. Condizione: Very Good. Fast Shipping - Safe and Secure 7 days a week! Codice articolo 3TWDDA004XBJ
Compra usato
EUR 21,94
Spedizione EUR 3,36
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 3 disponibili
Foto dell'editore
Complexity in Numerical Optimization
Da: Recycle Bookstore, San Jose, CA, U.S.A.
Valutazione del venditore 4 su 5 stelle
Hardcover. Condizione: Near Fine. Condizione sovraccoperta: Near Fine. The book has mild rubbing to both covers, a paper sticker fixed to the front endpage, and a black ink stamp on the half-title page, otherwise the book is in excellent condition with crisp, unmarked pages, a tight binding, and a strong, clean cover. The dustjacket has rubbing and surface scratching to both covers and a paper sticker on the back cover, otherwise the dustjacket is in similarly excellent condition, intact and attractive. Codice articolo 1038515
Compra usato
EUR 24,70
Spedizione EUR 4,84
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Complexity in Numerical Optimization
Editore:
World Scientific Pub Co Inc, 1993
ISBN 10: 9810214154
ISBN 13: 9789810214159
Antico o usato
Rilegato
Da: Orca Knowledge Systems, Inc., Novato, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Fine. Condizione sovraccoperta: Very Good. Signed. Signed and inscribed by the editor on the half title page. Inscribed to Professor S. Smale, Math Dept. City University of Hong Kong. No other markings in book. DJ with shelf wear to edges. Binding is tight. Very lightly read. Computational complexity, originated from the interactions between computer science and numerical optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. This volume is a collection of articles on recent complexity developments in numerical optimization. The topics covered include complexity of approximation algorithms, new polynomial time algorithms for convex quadratic minimization, interior point algorithms, complexity issues regarding test generation of NP-hard problems, complexity of scheduling problems, min-max, fractional combinatorial. Codice articolo 3007731
Compra usato
EUR 35,49
Spedizione EUR 5,00
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili