Show simple item record

Scaling algorithms for multicommodity flow problems and network flow problems with side constraits

dc.contributor.advisorJames B. Orlin.en_US
dc.contributor.authorSchneur, Rinaen_US
dc.date.accessioned2005-08-10T23:01:28Z
dc.date.available2005-08-10T23:01:28Z
dc.date.copyright1991en_US
dc.date.issued1991en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/13710
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1991.en_US
dc.descriptionIncludes bibliographical references (leaves 312-320).en_US
dc.description.statementofresponsibilityby Rina Schneur.en_US
dc.format.extent320 leavesen_US
dc.format.extent17410522 bytes
dc.format.extent17410277 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectCivil and Environmental Engineeringen_US
dc.titleScaling algorithms for multicommodity flow problems and network flow problems with side constraitsen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Civil and Environmental Engineering
dc.identifier.oclc24343698en_US


Files in this item

Thumbnail
Name:
24343698-MIT.pdf
Size:
16.60Mb
Format:
PDF
Description:
Full printable version
View/Open

This item appears in the following Collection(s)

Show simple item record