Study of Probabilistic Combinatorial Optimization Problems
{'Code': '07010000', 'Directorate': {'LongName': 'Directorate For Engineering'}, 'Division': {'LongName': 'Div Of Electrical, Commun & Cyber Sys'}}
{'SignBlockName': 'Radhakisan S. Baheti'}
This project deals with extending some general and classic                      deterministic combinatorial optimization problems to include                    probabilistic elements.  Specifically, the extensions will address the          shortest path, assignment, minimum spanning tree, traveling salesman,           and vehicle routing problems.  The study will explore solution                  characteristics and procedures.                                                                                                                                 Amedes Odini is an accomplished researcher in transportation networks.          MIT provides an excellent environment for conducted such work:  The             results are important and promising.                                                                                                                            An award for a one-year period is highly recommended.
{'FirstName': 'Amedeo', 'LastName': 'Odoni', 'EmailAddress': None, 'StartDate': '04/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Massachusetts Institute of Technology', 'CityName': 'Cambridge', 'ZipCode': '021394301', 'PhoneNumber': '6172531000', 'StreetAddress': '77 MASSACHUSETTS AVE', 'CountryName': 'United States', 'StateName': 'Massachusetts', 'StateCode': 'MA'}
{'Code': '1454', 'Text': 'SYSTEMS THEORY'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8717970.xml'}