A First Course Combinatorial Optimization

Informationen zum Autor Jon Lee is a passionate outdoorsman with 20 years of guiding experience, helping novices and experts alike thrive in the realm of angling and hunting. From the vast landscapes of Alaska to the picturesque waters of Key West, he's tackled it all: fly fishing and big game archery being his specialties. Based in Michigan, Jon is perpetually on the hunt for the next great adventure, channeling his experiences into captivating short stories that resonate with readers far and wide. Klappentext This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Zusammenfassung This text is for a one-semester introductory graduate course for students of operations research! mathematics! and computer science covers linear and integer programming! polytopes! matroids and matroid optimization! shortest paths! and network flows. The author focuses on the key mathematical ideas that lead to useful models and algorithms. Inhaltsverzeichnis Introduction; Polytopes and linear programming; 1. Matroids and the greedy algorithm; 2. Minimum-weight dipaths; 3. Matroid intersection; 4. Matching; 5. Flows and cuts; 6. Cutting planes; 7. Branch-&-bound; 8. Optimizing submodular functions; Appendix.

Product details

• Authors: John Lee, Jon Lee
• Assisted by: M. J. Ablowitz (Editor), D. G. Crighton (Editor)
• Publisher: Cambridge University Press Academic
• Languages: English
• Product format: Paperback / Softback
• Released: 30.04.2004
• EAN: 9780521010122
• ISBN: 978-0-521-01012-2
• Dimensions: 150 mm x 230 mm x 15 mm
• Series: Cambridge Texts in Applied Mat; Cambridge Texts in Applied Mat
• Subjects: Education and learning; Natural sciences, medicine, IT, technology > Mathematics > Probability theory, stochastic theory, mathematical statistics