"An infeasible-start algorithm for linear programming whose complexity ..."

Robert M. Freund (1996)

> Home

Details and statistics

DOI: 10.1007/BF02206810

access: closed

type: Journal Article

metadata version: 2020-08-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/anor/Freund96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/Freund96
Robert M. Freund:
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution. Ann. Oper. Res. 62(1): 29-57 (1996)

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.