Combinatorial Optimization

Abstract

Combinatorial optimization deals with optimization problems defined on polyhedral constraints or discrete structures such as graphs and networks. In the past thirty years the topic has developed into a rich mathematical discipline with many connections to other fields of mathematics such as combinatorics, group theory, geometry of numbers, convex analysis or real algebraic geometry. It also has strong ties to theoretical computer science and other more applied sciences (such as game theory and operations research).