Combinatorial Optimization
Theory and Algorithms (Algorithms and Combinatorics, 21)
Our rough guess is there are 132,500 words in this book.
At a pace averaging 250 words per minute, this book will take 8 hours and 50 minutes to read. With a half hour per day, this will take 18 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
132,500 words, Guess
Page Count
530 pages
Physical Format
Hardcover
Identifiers
- Open LibraryOL9063288M
- ISBN-139783540672265
- ISBN-103540672265
- OCLC Control Number44019408
- Library of Congress Control Number00032968
and 2 more
- Goodreads7191059
- LibraryThing531781
Classifications
- LCCQA402.5 .K6665 2000
Description
"This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete (but concise) proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state-of-the-art of combinatorial optimization."--BOOK JACKET.
Subjects
Other Editions
- Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!