CATBox An Interactive Course in Combinatorial Optimization /

• Κύριοι συγγραφείς: Hochstättler, Winfried (Συγγραφέας), Schliep, Alexander (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Θέματα: Mathematics.; Computer science > Mathematics.; Game theory.; Mathematical optimization.; Operations research.; Management science.; Discrete mathematics.; Combinatorics.; Discrete Mathematics.; Game Theory, Economics, Social and Behav. Sciences.; Optimization.; Operations Research, Management Science.; Discrete Mathematics in Computer Science.

Graph algorithms are easy to visualize and indeed there already exists a variety of packages and programs to animate the dynamics when solving problems from graph theory. Still, and somewhat surprisingly, it can be difficult to understand the ideas behind the algorithm from the dynamic display alone...

Πίνακας περιεχομένων:

• Discrete Problems from Applications
• Basics, Notation and Data Structures
• Minimum Spanning Trees
• Linear Programming Duality
• Shortest Paths
• Maximal Flows
• Minimum-Cost Flows
• Matching
• Weighted Matching.