Combinatorial optimization
Christos H. Papadimitriou
Reading Time
at 250 WPM8h 48m
The average reader, reading at a speed of 250 WPM, would take 8h 48m to read Combinatorial optimization.
Personalise your estimate by entering your reading speed below
Test my reading speedEnter speed in words per minute
18
days at 30 min/day
528
total minutes
Combinatorial optimization
Published
2013
Publisher
Dover Publications, Incorporated
Pages
528
ISBN-13
9780486320137
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
Combinatorial theory
Integer and combinatorial optimization
Applications of Combinatorial Optimization
Models, Algorithms and Technologies for Network Analysis
Concepts of Combinatorial Optimization
Combinatorial Optimization
Frequently Asked Questions
How many pages are in Combinatorial optimization?
This edition of Combinatorial optimization has approximately 528 pages. Please note, this is an estimate and the exact page count can vary between hardcover, paperback, and e-book versions.
How long does it take to read Combinatorial optimization?
For most readers, Combinatorial optimization typically takes between 11h 0m and 7h 20m to complete. This is based on the book's length of approximately 132,000 words and common reading speeds.
Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 8h 48m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 18 days • Estimated word count: 132,000 words
Your individual reading time will vary based on your personal reading pace, the amount of daily reading time, and your familiarity with the subject matter.
What is the word count of Combinatorial optimization?
The estimated word count for Combinatorial optimization is approximately 132,000 words. This figure is calculated using industry-standard methods that consider genre-specific word density patterns, typical formatting and layout characteristics, and standard words-per-page ratios for published books.
This is an approximation — actual word count may vary based on font size, formatting, edition, and the presence of illustrations or charts.
Who is the author of Combinatorial optimization?
Combinatorial optimization was written by Christos H. Papadimitriou.
When was Combinatorial optimization published?
The publication date for this specific edition is 2013. The original work may have been published on a different date.