Return to search

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

No description available.
Identiferoai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:QMM.48537
Date January 1975
CreatorsMavrogenis, Paris.
PublisherMcGill University
Source SetsLibrary and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada
LanguageEnglish
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation
Formatapplication/pdf
CoverageMaster of Science (School of Computer Science)
RightsAll items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated.
Relationalephsysno: 000258682, proquestno: AAIMK24374, Theses scanned by UMI/ProQuest.

Page generated in 0.002 seconds