Wheelers Books

Concepts of Combinatorial Optimization

Concepts of Combinatorial Optimization
 

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in... read full description below.

This title is not currently available locally but showing available from overseas supplier on backorder – please allow 4-8 weeks for delivery.

Quick Reference

ISBN 9781848216563
Barcode 9781848216563
Published 15 September 2014 by John Wiley & Sons Australia Lt
Format Hardback, 2nd Edition
Author(s) Edited by Paschos, Vangelis Th.
Series Iste
Availability Internationally sourced on backorder; allow 4-8 weeks

... view full title details below.

Buy Now

  • $553.50 Wheelers price
Add to Basket Add to Wishlist

Full details for this title

ISBN-13 9781848216563
ISBN-10 1848216564
Stock Available
Status Internationally sourced on backorder; allow 4-8 weeks
Publisher John Wiley & Sons Australia Lt
Imprint ISTE Ltd and John Wiley & Sons Inc
Publication Date 15 September 2014
International Publication Date 29 July 2014
Publication Country United Kingdom United Kingdom
Format Hardback, 2nd Edition
Edition 2nd Edition
Author(s) Edited by Paschos, Vangelis Th.
Series Iste
Category Management Decision Making
Optimization
General Theory of Computing
Applications of Computing
Number of Pages 416
Dimensions Width: 164mm
Height: 243mm
Spine: 27mm
Weight 748g
Interest Age 19+ years
Reading Age 19+ years
Library of Congress Programming (Mathematics), Combinatorial optimization
NBS Text Mathematics
ONIX Text College/higher education;Professional and scholarly
Dewey Code 519.64
Catalogue Code Not specified

Description of this Book

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series 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. Concepts of Combinatorial Optimization, is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity;- Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;- Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

^ top

Awards, Reviews & Star Ratings

There are no reviews for this title.

^ top

Author's Bio

Vangelis T. 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.

^ top