Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
105
Voted
MP
2008
61
views
more
MP 2008
»
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
15 years 2 months ago
Download
www.cas.mcmaster.ca
Abstract By refining a variant of the Klee
Antoine Deza, Eissa Nematollahi, Tamás Terl
Real-time Traffic
Interior Point
|
Interior Point Methods
|
MP 2008
|
N-dimensional Linear Optimization
|
claim paper
Related Content
»
A simpler and tighter redundant KleeMinty construction
more »
Post Info
More Details (n/a)
Added
13 Dec 2010
Updated
13 Dec 2010
Type
Journal
Year
2008
Where
MP
Authors
Antoine Deza, Eissa Nematollahi, Tamás Terlaky
Comments
(0)
Researcher Info
MP 1998 Study Group
Computer Vision