A new perspective on the complexity of interior point methods for linear programming - ORA - Oxford University Research Archive

Back to Search

Report

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

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Cartis, C., & Hauser, R. (2016). A new perspective on the complexity of interior point methods for linear programming.

MLA Style

Cartis, C., and R. Hauser. A New Perspective on the Complexity of Interior Point Methods for Linear Programming. 2016.

Chicago Style

Cartis, C, and R Hauser. 2016. “A New Perspective on the Complexity of Interior Point Methods for Linear Programming.”
Tweet
Print

Authors

+ Cartis, C More by this author

Role:

Author

+ Hauser, R More by this author

Role:

Author

Bibliographic Details

Publication date:: 2007-01-01

Item Description

UUID:: uuid:1b82e021-df41-40f4-bbc8-d9a445c1c4f9
Local pid:: cs:2563
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2007

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Metrics

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP