The strength of surrogate constraints for the linear zero-one integer programming problem
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
Contributions
- Naval Postgraduate School (U.S.) - Contributor
Publication
1982 - Naval Postgraduate School, Monterey, California, California
Language
English
Word Count
5,000 words, Guess
Page Count
20 pages
Identifiers
- Internet Archivestrengthofsurrog00gior
- OCLC Control Number77630558
- Open LibraryOL25450646M
Description
In this report the author discusses the strength of surrogate constraints in general and presents a heuristic procedure for iteratively constructing stronger surrogates beginning with the dual multiplier surrogate.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!