CORE
馃嚭馃嚘聽
聽 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
Authors
Publication date
1 January 1988
Publisher
Massachusetts Institute of Technology, Operations Research Center
Abstract
Includes bibliographical references (p. 28-29).by Robert M. Freund
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
DSpace@MIT
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dspace.mit.edu:1721.1/5245
Last time updated on 11/06/2012