Combinatorial Optimization

Review of the book
This book has 8 sections, each section starts with a simple introduction to the topic and then ends with more advanced topics. Although this book has tried to explain the content in a simple way, it is expected that the reader is familiar with the concepts of combinatorial optimization, and this book is designed for graduate students and researchers.

Table of Contents
The eight sections of this book include the following:

Path and flow issues
Covering and matching for bipartite graph
Covering and matching for non-bipartite graph
Submolular functions
trees
clique, sets and coloring problem
Disjoint paths
Hypergraph

Click here to view the table of contents.