| Article ID: | iaor19981844 |
| Country: | China |
| Volume: | 13 |
| Issue: | 2 |
| Start Page Number: | 221 |
| End Page Number: | 224 |
| Publication Date: | Apr 1997 |
| Journal: | Acta Mathematicae Applicanda Sinica |
| Authors: | Yang C.E., Liang S.I. |
There are numerous problems in combinatorial optimization. Their solutions are different from one another. There is no unified approach that can be used to all problems in combinatorial optimization. However, there exists a unified approach that can be used to solve a class of problems in combinatorial optimization relating to graphs. This approach is by a primal–dual algorithm (PD algorithm).