|
![]() |
|||
|
||||
OverviewCombinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization set aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Full Product DetailsAuthor: Vangelis Th. PaschosPublisher: ISTE Ltd and John Wiley & Sons Inc Imprint: ISTE Ltd and John Wiley & Sons Inc Dimensions: Width: 16.00cm , Height: 9.70cm , Length: 23.70cm Weight: 2.638kg ISBN: 9781848211469ISBN 10: 1848211465 Pages: 1264 Publication Date: 23 July 2010 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Out of Print Availability: In Print ![]() Limited stock is available. It will be ordered for you and shipped pending supplier's limited stock. Table of ContentsReviewsThis reference set is a self-contained treatment and is intended for researchers, practitioners, and graduate students involved with this burgeoning multidisciplinary field. (Booknews, 1 February 2011)<p> Each of the three volumes of this set is individually titled and has its own ISBN, as follows: volume 1: Concepts of Combinatorial Optimization (978-1-84821-147-6); volume 2: Paradigms of Combinatorial Optimization; Problems and New Approaches (978-1-84821-148-3); and volume 3: Applications of Combinatorial Optimization (1-978-84821-149-0). Editor Paschos (computer science and combinatorial optimization, Paris-Dauphine University) offers an enthusiastic preface to each volume explaining its scope. He begins by briefly defining the subject (although he says there are as many definitions as there are researchers in this field); for him, it is above all the art of understanding a real, natural problem, and being able to transform it into a mathematical model....[it is] at the heart of the junction of scientific disciplines as rich and different as theoretical computer science, pure and applied, discrete and continuous mathematics, mathematical economics, and quantitative management. This reference set is a self-contained treatment and is intended for researchers, practitioners, and graduate students involved with this burgeoning multidisciplinary field. The three volumes are updated versions derived from Optimisation Combinatoire volumes 1 through 5, published 2005-2007 in France by Hermes Science/Lavoisier. ( Reference and Research Book News , February 2011) Each of the three volumes of this set is individually titled and has its own ISBN, as follows: volume 1: Concepts of Combinatorial Optimization (978-1-84821-147-6); volume 2: Paradigms of Combinatorial Optimization; Problems and New Approaches (978-1-84821-148-3); and volume 3: Applications of Combinatorial Optimization (1-978-84821-149-0). Editor Paschos (computer science and combinatorial optimization, Paris-Dauphine University) offers an enthusiastic preface to each volume explaining its scope. He begins by briefly defining the subject (although he says there are as many definitions as there are researchers in this field); for him, it is above all the art of understanding a real, natural problem, and being able to transform it into a mathematical model....[it is] at the heart of the junction of scientific disciplines as rich and different as theoretical computer science, pure and applied, discrete and continuous mathematics, mathematical economics, and quantitative managemen This reference set is a self-contained treatment and is intended for researchers, practitioners, and graduate students involved with this burgeoning multidisciplinary field. (Booknews, 1 February 2011)<p> Each of the three volumes of this set is individually titled and has its own ISBN, as follows: volume 1: Concepts of Combinatorial Optimization (978-1-84821-147-6); volume 2: Paradigms of Combinatorial Optimization; Problems and New Approaches (978-1-84821-148-3); and volume 3: Applications of Combinatorial Optimization (1-978-84821-149-0). Editor Paschos (computer science and combinatorial optimization, Paris-Dauphine University) offers an enthusiastic preface to each volume explaining its scope. He begins by briefly defining the subject (although he says there are as many definitions as there are researchers in this field); for him, it is above all the art of understanding a real, natural problem, and being able to transform it into a mathematical model....[it is] at the he This reference set is a self-contained treatment and is intended for researchers, practitioners, and graduate students involved with this burgeoning multidisciplinary field. (Booknews, 1 February 2011) Each of the three volumes of this set is individually titled and has its own ISBN, as follows: volume 1: Concepts of Combinatorial Optimization (978-1-84821-147-6); volume 2: Paradigms of Combinatorial Optimization; Problems and New Approaches (978-1-84821-148-3); and volume 3: Applications of Combinatorial Optimization (1-978-84821-149-0). Editor Paschos (computer science and combinatorial optimization, Paris-Dauphine University) offers an enthusiastic preface to each volume explaining its scope. He begins by briefly defining the subject (although he says there are as many definitions as there are researchers in this field); for him, it is above all the art of understanding a real, natural problem, and being able to transform it into a mathematical model...[it is] at the heart of the junction of scientific disciplines as rich and different as theoretical computer science, pure and applied, discrete and continuous mathematics, mathematical economics, and quantitative management. This reference set is a self-contained treatment and is intended for researchers, practitioners, and graduate students involved with this burgeoning multidisciplinary field. The three volumes are updated versions derived from Optimisation Combinatoire volumes 1 through 5, published 2005-2007 in France by Hermes Science/Lavoisier. ( Reference and Research Book News , February 2011) Author InformationVangelis Th. Paschos is Professor of Computer Science at the University of Paris-Dauphine and Chairman of the LAMSADE (Laboratory for the Modeling and the Analysis of Decision Aiding Systems). His research interests include complexity theory, the theory of the polynomial approximation of NP-hard problems, probabilistic combinatorial optimization and on-line computation. He is the author of more than a 100 research papers and is a member of the editorial board of several international scientific journals. Tab Content 6Author Website:Countries AvailableAll regions |