A new perspective on the complexity of interior point methods for linear programming

Bibliographic Details
Main Authors: Cartis, C, Hauser, R
Format: Report
Published: 2007
_version_ 1797056633094799360
author Cartis, C
Hauser, R
author_facet Cartis, C
Hauser, R
author_sort Cartis, C
collection OXFORD
description
first_indexed 2024-03-06T19:25:21Z
format Report
id oxford-uuid:1b82e021-df41-40f4-bbc8-d9a445c1c4f9
institution University of Oxford
last_indexed 2024-03-06T19:25:21Z
publishDate 2007
record_format dspace
spelling oxford-uuid:1b82e021-df41-40f4-bbc8-d9a445c1c4f92022-03-26T11:00:44ZA new perspective on the complexity of interior point methods for linear programmingReporthttp://purl.org/coar/resource_type/c_93fcuuid:1b82e021-df41-40f4-bbc8-d9a445c1c4f9Department of Computer Science2007Cartis, CHauser, R
spellingShingle Cartis, C
Hauser, R
A new perspective on the complexity of interior point methods for linear programming
title A new perspective on the complexity of interior point methods for linear programming
title_full A new perspective on the complexity of interior point methods for linear programming
title_fullStr A new perspective on the complexity of interior point methods for linear programming
title_full_unstemmed A new perspective on the complexity of interior point methods for linear programming
title_short A new perspective on the complexity of interior point methods for linear programming
title_sort new perspective on the complexity of interior point methods for linear programming
work_keys_str_mv AT cartisc anewperspectiveonthecomplexityofinteriorpointmethodsforlinearprogramming
AT hauserr anewperspectiveonthecomplexityofinteriorpointmethodsforlinearprogramming
AT cartisc newperspectiveonthecomplexityofinteriorpointmethodsforlinearprogramming
AT hauserr newperspectiveonthecomplexityofinteriorpointmethodsforlinearprogramming