ROW: Solving Large Discrete Optimization Problems Using     Polyhedral Theory & Branch and Cut
{'Code': '07010000', 'Directorate': {'LongName': 'Directorate For Engineering'}, 'Division': {'LongName': 'Div Of Electrical, Commun & Cyber Sys'}}
{'SignBlockName': 'Radhakisan S. Baheti'}
The goal of this research is to unify and expand on many of the                 traditional approaches to solving integer programming problems by               incorporating them into a software package.  In additon, a new approach         called "branch and cut" is proposed which promises to replace the               branch and bound approach traditionally used to prove optimality.               Integer programming problems arise in a wide range of engineering               optimization problems where resources, such as machines are                     indivisible.
[{'FirstName': 'Manfred', 'LastName': 'Padberg', 'EmailAddress': None, 'StartDate': '04/01/1987', 'EndDate': None, 'RoleCode': 'Co-Principal Investigator'}, {'FirstName': 'Karla', 'LastName': 'Hoffman', 'EmailAddress': 'khoffman@gmu.edu', 'StartDate': '04/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}]
{'Name': 'George Mason University', 'CityName': 'FAIRFAX', 'ZipCode': '220304422', 'PhoneNumber': '7039932295', 'StreetAddress': '4400 UNIVERSITY DR', 'CountryName': 'United States', 'StateName': 'Virginia', 'StateCode': 'VA'}
[{'Code': '1454', 'Text': 'SYSTEMS THEORY'}, {'Code': '1495', 'Text': 'COMPUTATIONAL ENGINEERING'}, {'Code': '9120', 'Text': 'CROSS-DIRECTORATE PROGRAMS'}]
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1986&All=true', 'xml': '8615438.xml'}