Combinatorial optimization
algorithms and complexity
Our rough guess is there are 124,000 words in this book.
At a pace averaging 250 words per minute, this book will take 8 hours and 16 minutes to read. With a half hour per day, this will take 17 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.
Author
Contributions
- Steiglitz, Kenneth, 1939- - Contributor
Publication
1982 - Prentice Hall, Englewood Cliffs, N.J, New Jersey
Language
English
Word Count
124,000 words, Guess
Page Count
496 pages
Identifiers
- Internet Archivecombinatorialopt0000papa
- ISBN-139780131524620
- ISBN-100131524623
- Goodreads3988616
- LibraryThing198010
and 4 more
- Library of Congress Control Number81005866
- OCLC Control Number7463296
- Better World Books9780131524620
- Open LibraryOL4260237M
Classifications
- DDC519
- LCCQA402.5 .P37
- LCCQA402.5.P37
Description
Christos H. Papadimitriou and Kenneth Steiglitz have combined the theory of computational complexity developed by computer scientists, and the foundations of mathematical programming developed by the operations research community. This text will be useful to students with a wide range of backgrounds, including computer science, operations research, and electrical engineering.
Subjects
Other Editions
- Combinatorial optimization: algorithms and complexity
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!