NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.037 seconds)

Spelling suggestions: "subject:"228 .414 no.3558-, 93"" "subject:"228 .m414 no.3558-, 93""

1

On the worst case complexity of potential reduction algorithms for linear programming

January 1993 (has links)
Dimitris Bertsimas and Xiaodong Luo. / Includes bibliographical references (p. 16-17). / Supported by a Presidential Young Investigator Award. DDM-9158118 Supported by Draper Laboratory.
HD28 .M414 no.3558-, 93

Page generated in 0.0411 seconds