Presidential Young Investigators Award: Combinatorial       Optimization Problems
{'Code': '07010000', 'Directorate': {'LongName': 'Directorate For Engineering'}, 'Division': {'LongName': 'Div Of Electrical, Commun & Cyber Sys'}}
{'SignBlockName': None}
Two major research thrusts will be pursued:  optimization of algebraic          systems and dynamic vehicle routing.  Within optimization of algebraic          systems, the focus will be on the "matroid parity" problem.  The major          goal of this work is algorithmic and conceptual and is an elegant               generalization of a number of important problems in combinatorial               optimization.  In the area of dynamic vehicle routing, the goal is to           develop effective heuristic procedures for solving the emergency                scheduling problem.  The methodologies will include interactive                 scheduling and hierarchical decomposition techniques.  It is expected           that this research will extend the "state-of-the-art" in dynamic                scheduling and routing problems by drawing on research developments             from mathematical programming, combinatorial optimization, control              theory, queueing theory, and artificial intelligence.
{'FirstName': 'James', 'LastName': 'Orlin', 'EmailAddress': 'jorlin@mit.edu', 'StartDate': '07/01/1985', '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'}, {'Code': '5514', 'Text': 'OPERATIONS RESEARCH'}]
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1984&All=true', 'xml': '8451517.xml'}