Ir al contenido

Documat


Resumen de Identifying violated maximal cover inequalities in 0-1 problems

S. Muñoz

  • We present a procedure for identifying all maximal covers from the set of covers implied by a 0-1 knapsack constraint whose induced inequalities are violated by a given fractional solution. It is well known that inequalities induced by covers have numerous applications in 0-1 model tightening. Therefore, our procedure can be very useful for this purpose. Some computational experiments are reported for single source capacitated plant location problem instances drawn from the literature. They show the efficiency of treating the inequalities induced by our maximal covers as cutting planes in a branch-and-cut framework.


Fundación Dialnet

Mi Documat