| Article ID: | iaor20043334 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 1 |
| Start Page Number: | 49 |
| End Page Number: | 58 |
| Publication Date: | Jan 2004 |
| Journal: | Operations Research Letters |
| Authors: | Hochbaum Dorit S. |
| Keywords: | programming: network |
Linear programming problems with up to two nonzeroes per column in the constraint matrix are shown equivalent to generalized network flow problem. The transformation is applied for solving the maximum cut problem, the