Return to search

A simplex based computational procedure for the maximal multi-transformed network flows problem /

No description available.
Identiferoai:union.ndltd.org:mcgill.ca/oai:escholarship.mcgill.ca:hq37vp982
Date January 1975
CreatorsMavrogenis, Paris.
PublisherMcGill University
Source SetsMcGill University
Languagehttp://id.loc.gov/vocabulary/iso639-2/eng
Detected LanguageEnglish
TypeThesis
RightsAll items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated.
RelationPid: 48537, Proquest: AAIMK24374

Page generated in 0.0019 seconds