Date of Original Version

4-2009

Type

Article

Rights Management

The original publication is available at www.springerlink.com

Abstract or Description

In this paper, a methodology for testing the accuracy and strength of cut generators for mixed-integer linear programming is presented. The procedure amounts to random diving towards a feasible solution, recording several kinds of failures. This allows for a ranking of the accuracy of the generators. Then, for generators deemed to have similar accuracy, statistical tests are performed to compare their relative strength. An application on eight Gomory cut generators and six Reduce-and-Split cut generators is given. The problem of constructing benchmark instances for which feasible solutions can be obtained is also addressed.

DOI

10.1007/s12532-009-0003-7

Share

COinS
 

Published In

Mathematical Programming Computation , 1, 69-95.