Newton's method for fractional combinatorial optimization
Our rough guess is there are 5,000 words in this book.
At a pace averaging 250 words per minute, this book will take 0 hours and 20 minutes to read. With a half hour per day, this will take 1 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
Publication
1992 - Dept. of Computer Science, Stanford University, Stanford, Calif, California
Language
English
Word Count
5,000 words, Guess
Page Count
20 pages
Identifiers
- Library of Congress Control Number92186946
- Open LibraryOL1314736M
Classifications
- DDC511/.6
- LCCQA297.8 .R33 1992
Alternate Titles
- Fractional combinatorial optimization.
Subjects
Topics
Data processingNewton-Raphson methodCombinatorial optimizationNewton-Raphson method -- Data processingCombinatorial optimization -- Data processing
Series Statement
- Report ;
- no. STAN-CS-92-1406
- Report (Stanford University. Computer Science Dept.) ;
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!