Accession Number:

ADA278242

Title:

Solution Procedures for Large-Scale Combinatorial Optimization

Descriptive Note:

Final rept. 1 Mar 1990-31 Aug 1993

Corporate Author:

GEORGE MASON UNIV FAIRFAX VA

Personal Author(s):

• Hoffman, Karla L.

Report Date:

1993-08-31

Pagination or Media Count:

7.0

Abstract:

Results of research performed under this grant have shown that problems having thousands, and sometimes millions, of variables can be solved using present-day technology based on mathematical results that utilize the structure underlying the problem and that incorporate related advances of the mathematical theory into a general approach called branch-and-cut. The term branch-and-cut and the ideas encompassing it, are the direct result of this research effort. Now the two leading commercial codes for solving integer programming problems, OSL and CpleX both incorporate cutting plane ideas and use the term branch-and-cut in their marketing literature.

Descriptors:

• *INTEGER PROGRAMMING
• *LARGE SCALE INTEGRATION
• ALGORITHMS
• OPTIMIZATION
• HEURISTIC METHODS
• COMBINATORIAL ANALYSIS
• PARALLEL PROCESSING
• LINEAR PROGRAMMING

Subject Categories:

• Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE