| Article ID: | iaor20051949 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 3 |
| Start Page Number: | 305 |
| End Page Number: | 312 |
| Publication Date: | May 2005 |
| Journal: | Operations Research Letters |
| Authors: | Jttner Alpr |
| Keywords: | combinatorial analysis |
Norton, Plotkin and Tardos proved that, loosely spoken, an LP problem is solvable in time