Return to search

E-relaxation and auction method for separable convex cost network flow problems

by Dimitri P. Bertsekas, Lazaros C. Polymenakos and Paul Tseng. / Caption title. / Includes bibliographical references (p. 19-21). / Supported by the NSF. CCR-9103804 9300494-DMI

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/3438
Date January 1996
ContributorsBertsekas, Dimitri P., Polymenakos, Lazaros., Tseng, Paul., Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
PublisherMassachusetts Institute of Technology, Laboratory for Information and Decision Systems
Source SetsM.I.T. Theses and Dissertation
LanguageEnglish
Detected LanguageEnglish
Format21, iii p., 1985457 bytes, application/pdf
RelationLIDS-P ; 2367

Page generated in 0.002 seconds