"On the Complexity of Solving Feasible Linear Programs Specified with ..."

Sharon Filipowski (1999)

> Home

Details and statistics

DOI: 10.1137/S1052623494268467

access: closed

type: Journal Article

metadata version: 2020-06-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamjo/Filipowski99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamjo/Filipowski99
Sharon Filipowski:
On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data. SIAM J. Optim. 9(4): 1010-1040 (1999)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.