Topics in Combinatorial Optimization

Inhaltsverzeichnis

• Computing Shortest Paths in Networks.
• Optimal Unconstrained Cycles in Graphs.
• Optimal Constrained Cycles in Graphs.
• The Traveling Salesman Problem and its Implications.
• Complexity of Combinatorial Computations.
• Overview of Network Flow Theory.
• Some Aspects of Duality in Combinatorial Optimization.
• Branching Methods in Combinatorial Optimization.
• On the Foundations of Dynamic Programming.
• Parking Functions and Information Structures.
• An Introduction to Matroid Optimization.