Accession Number:

ADA278242

Title:

Solution Procedures for Large-Scale Combinatorial Optimization

Personal Author(s):

Corporate Author:

GEORGE MASON UNIV FAIRFAX VA

Report Date:

1993-08-31

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.

Descriptive Note:

Final rept. 1 Mar 1990-31 Aug 1993

Supplementary Note:

DOI: 10.21236/ADA278242

Pages:

0007

Subject Categories:

Communities Of Interest:

Distribution Statement:

Approved for public release; distribution is unlimited.

Contract Number:

F4620-90-C-0022

File Size:

0.34MB