Return to search

Shortest Path - Capacitated Maximum Covering Problems

No description available.
Identiferoai:union.ndltd.org:OhioLink/oai:etd.ohiolink.edu:osu1275477591
Date03 September 2010
CreatorsHua, Liyan
PublisherThe Ohio State University / OhioLINK
Source SetsOhiolink ETDs
LanguageEnglish
Detected LanguageEnglish
Typetext
Sourcehttp://rave.ohiolink.edu/etdc/view?acc_num=osu1275477591
Rightsunrestricted, This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws.

Page generated in 0.0019 seconds