Iterative Methods in Combinatorial Optimization (Cambridge Texts in Applied Mathematics, Series Number 46)

Lau, Lap Chi; Ravi, R.; Singh, Mohit

ISBN 10: 1107007518 / ISBN 13: 9781107007512

Editore: Cambridge University Press, 2011

Riguardo questo articolo

Codice articolo ABLIING23Mar2317530263092

Dati bibliografici

Titolo: Iterative Methods in Combinatorial ...

Casa editrice: Cambridge University Press

Data di pubblicazione: 2011

Legatura: Rilegato

Condizione: New

Descrizione articolo

Riassunto:

A simple, powerful method that is iterative and useful in a variety of settings for exact and approximate optimization.

Informazioni sugli autori:

Lap-Chi Lau is an Assistant Professor in the Department of Computer Science and Engineering at The Chinese University of Hong Kong. Lap-Chi's main research interests are in combinatorial optimization and graph algorithms. His paper on Steiner tree packing was given the Machtey award in the IEEE Foundations of Computer Science Conference. His Ph.D. thesis was awarded the Doctoral Prize from the Canadian Mathematical Society and a Doctoral Prize from the Natural Sciences and Engineering Research Council of Canada.

R. Ravi is Carnegie Bosch Professor of Operations Research and Computer Science at Carnegie Mellon University. Ravi's main research interests are in combinatorial optimization (particularly in approximation algorithms), computational molecular biology and electronic commerce. He is currently on the editorial boards of Management Science and the ACM Transactions on Algorithms.

Mohit Singh is an Assistant Professor in the School of Computer Science, McGill University. He completed his Ph.D. in 2008 at the Tepper School of Business, Carnegie Mellon University, where his advisor was Professor R. Ravi. His thesis was awarded the Tucker prize by the Mathematical Programming Society. His research interests include approximation algorithms, combinatorial optimization and studying models that deal with uncertainty in data.