Combinatorial Optimization

(Mathematical Optimization)
↑
Combinatorial Optimization
↓
find optimal object
{
finite set of
objects
}
→ discrete
Examples
  • Travelling Salesman Problem (“TSP”)
  • Minimum Spanning Tree problem (“MST”)

Combinatorial Optimization is a specialized subfield within the broader category of Mathematical Optimization. Unlike continuous optimization where solutions exist along an infinite spectrum, combinatorial optimization focuses on finding the best (“optimal”) object from a strictly finite set of objects. Because the possibilities are limited to distinct, separate choices, this type of mathematics is fundamentally discrete.

Two of the most famous examples of this are:

  • The Travelling Salesman Problem (TSP): Finding the absolute shortest possible route to visit a specific list of cities exactly once.
  • The Minimum Spanning Tree (MST): Finding the most efficient path that connects all nodes without any closed loops or wasted connections.

References

‌

error: