| Article ID: | iaor1993729 |
| Country: | Netherlands |
| Volume: | 56 |
| Issue: | 3 |
| Start Page Number: | 245 |
| End Page Number: | 284 |
| Publication Date: | Oct 1992 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Todd Michael J., MiItchell John E. |
| Keywords: | Karmarkar's method |
The authors describe a cutting plane algorithm for solving combinatorial optimization problems. The primal projective standard-form variant of Karmarkar’s algorithm for linear programming is applied to the duals of a sequence of a linear programming relaxations of the combinatorial optimization problem.