A Polyhedral Based Software System for Solving              Generalized Assignment Problems
{'Code': '05010200', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'S. Kamal Abdali', 'PO_EMAI': None, 'PO_PHON': None}
The generalized assignment problem (GAP) is a specially structured              integer programming problem.  Typical applications include facility             location, personnel assignment, logistics and computer networking.  A           totally automated software package designed for solving large-scale GAP         and related problems will be available for both experimental purposes           and production applications.                                                                                                                                    The resultant software will be a linear programming based system which          incorporates a polyhedral cutting plane philosophy.  This approach,             which is particularly geared toward the solution of large-scale                 problems, is based upon the structural properties of the polytope               associated with GAP.  In general, current solution methods for GAP              ignore the structure of the polytope; consequently, these methods tend          to be appropriate only for problems of moderate size since                      computational requirements tend to increase very rapidly as problem             size increases.                                                                                                                                                 The foundation for the system will depend upon constraint                       identification algorithms developed for three classes of facet defining         inequalities which have been derived for GAP.  These facet defining             inequalities represent a significant extension within this area of              integer programming since they are based upon combinations of knapsack          constraints.  On the other hand, currently available integer                    programming systems, which employ a polyhedral philosophy, have only            considered the information embedded within individual knapsack                  constraints when generating inequalities.
{'FirstName': 'Elsie', 'LastName': 'Gottlieb', 'PI_MID_INIT': 'S', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Elsie S Gottlieb', 'EmailAddress': None, 'NSF_ID': '000168788', 'StartDate': '08/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'CUNY Baruch College', 'CityName': 'NEW YORK', 'ZipCode': '100105585', 'PhoneNumber': '6463122211', 'StreetAddress': '1 BERNARD BARUCH WAY', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'New York', 'StateCode': 'NY', 'CONGRESSDISTRICT': '12', 'CONGRESS_DISTRICT_ORG': 'NY12', 'ORG_UEI_NUM': 'CBKYNSMGNDD5', 'ORG_LGL_BUS_NAME': 'RESEARCH FOUNDATION OF THE CITY UNIVERSITY OF NEW YORK', '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': '912000', 'Text': 'CROSS-DIRECTORATE PROGRAMS'}, {'Code': '914500', 'Text': 'SPECIAL PROGRAMS-RESERVE'}]
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8812736.xml'}