In this talk we investigate computational issues related to the generation of deep lift-and-project or disjunctive cuts for mixed 0-1 programs. We show that the best strategies in practice involve the generation of several cutting planes for the same disjunctive relaxation of the problem. This means that the fractional point is separated by several cutting planes from the same family with different characteristics such as density, support and depth. Computational results on the MIPLIB data set will be reported.
Lift-and-project cuts for mixed 0-1 programs: new computational results
ROSSI, FABRIZIO
1997-01-01
Abstract
In this talk we investigate computational issues related to the generation of deep lift-and-project or disjunctive cuts for mixed 0-1 programs. We show that the best strategies in practice involve the generation of several cutting planes for the same disjunctive relaxation of the problem. This means that the fractional point is separated by several cutting planes from the same family with different characteristics such as density, support and depth. Computational results on the MIPLIB data set will be reported.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
