Title
Optimization Algorithms For Networks And Graphs: Second Edition, Revised And Expanded
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
A Revised And Expanded Advancedundergraduate/Graduate Text (First Ed., 1978) About Optimization Algorithms For Problems That Can Be Formulated On Graphs And Networks. This Edition Provides Many New Applications And Algorithms While Maintaining The Classic Foundations On Which Contemporary Algorithm
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What is the size of this book? A: This book measures seven point twenty-four inches in length, one point twenty-six inches in width, and nine point forty-nine inches in height.
- Q: How many pages does this book have? A: This book contains four hundred eighty-two pages, providing a comprehensive exploration of optimization algorithms.
- Q: What type of binding does this book have? A: This book is bound in hardcover, ensuring durability for frequent use.
- Q: Who is the author of this book? A: The author of this book is James Evans, who provides expert insights into optimization algorithms.
- Q: What is the main focus of this book? A: This book focuses on optimization algorithms specifically for networks and graphs, making it suitable for advanced undergraduate and graduate studies.
- Q: Is this book suitable for beginners? A: No, this book is designed for advanced-undergraduate and graduate students, requiring prior knowledge in algorithms.
- Q: How can I use this book for my studies? A: You can use this book as a reference for advanced coursework in algorithms, or as a supplementary text for research projects.
- Q: Is this edition updated with new content? A: Yes, this edition is revised and expanded, featuring many new applications and algorithms.
- Q: What subjects does this book cover? A: This book covers optimization algorithms in the context of graphs and networks, along with contemporary applications.
- Q: How should I store this book? A: Store this book upright on a shelf or in a bookcase to prevent damage and ensure its longevity.
- Q: Can I return this book if I am not satisfied? A: Yes, most retailers offer return policies that allow you to return the book if you are not satisfied.
- Q: What condition is this used book in? A: This is a used book in good condition, meaning it has been previously owned but is still functional and readable.
- Q: Is there a warranty for this book? A: No, books typically do not come with warranties, but check with the retailer for their specific policies.
- Q: What if the book arrives damaged? A: If the book arrives damaged, contact the retailer for return or replacement options.
- Q: Are there any special features to this book? A: Yes, this book includes expanded sections on new applications, providing a deeper understanding of optimization algorithms.
- Q: Is this book recommended for professional use? A: Yes, this book is suitable for professionals in fields that require knowledge of optimization algorithms in networks and graphs.