This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows.
This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows.
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.
Inhaltsangabe
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.
