English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming

Mehlhorn, K., & Saxena, S. (2015). A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming. Retrieved from http://arxiv.org/abs/1510.03339.

Item is

Files

show Files
hide Files
:
arXiv:1510.03339.pdf (Preprint), 190KB
Name:
arXiv:1510.03339.pdf
Description:
File downloaded from arXiv at 2015-11-06 10:37
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Saxena, Sanjeev2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: Computer Science, Data Structures and Algorithms, cs.DS,Mathematics, Optimization and Control, math.OC
 Abstract: Linear programming is now included in algorithm undergraduate and postgraduate courses for computer science majors. We show that it is possible to teach interior-point methods directly to students with just minimal knowledge of linear algebra.

Details

show
hide
Language(s): eng - English
 Dates: 2015-10-122015
 Publication Status: Published online
 Pages: 16 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: arXiv: 1510.03339
URI: http://arxiv.org/abs/1510.03339
BibTex Citekey: MehlhornSaxena2015
 Degree: -

Event

show

Legal Case

show

Project information

show

Source

show