Network Location Theory
{'Code': '07010000', 'Directorate': {'Abbreviation': 'ENG', 'LongName': 'Directorate For Engineering'}, 'Division': {'Abbreviation': 'ECCS', 'LongName': 'Div Of Electrical, Commun & Cyber Sys'}}
{'SignBlockName': 'Radhakisan Baheti', 'PO_EMAI': None, 'PO_PHON': None}
Network location problems involve locating one or more new facilities           on a network, such as a transport network, when costs of some sort are          incurred which are proportional to network travel distances between new         facilities and existing facilities on the network, as well as possibly          to distances between new facilities.  The new facilities are to be              located on the network so as to minimize an objective function.  There          may also be distance constraints imposing upper bounds on how far apart         facilities can be.  The principal approach to solving such problems in          the past, when the problems have been continuous (considering all               possible locations on every link) has been to exploit network                   structure.  Recently it has been shown that many such continuous                problems may be formulated as mathematical programming problems                 (well-defined mathematical optimization problems).  This research will          focus on solving continuous network location problems by exploiting             connections with mathematical programming.  Since the latter field is           quite highly developed, the opportunities for improving our ability to          solve network location problems appear very promising.
{'FirstName': 'Timothy', 'LastName': 'Lowe', 'PI_MID_INIT': 'J', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Timothy J Lowe', 'EmailAddress': 'tjl12@psu.edu', 'NSF_ID': '000388324', 'StartDate': '03/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Purdue University', 'CityName': 'WEST LAFAYETTE', 'ZipCode': '479061332', 'PhoneNumber': '7654941055', 'StreetAddress': '2550 NORTHWESTERN AVE # 1100', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Indiana', 'StateCode': 'IN', 'CONGRESSDISTRICT': '04', 'CONGRESS_DISTRICT_ORG': 'IN04', 'ORG_UEI_NUM': 'YRXVL4JYCEF5', 'ORG_LGL_BUS_NAME': 'PURDUE UNIVERSITY', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '1454', 'Text': 'SYSTEMS THEORY'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1986&All=true', 'xml': '8612907.xml'}