We investigate the algorithmic and implementation issues related to the effective and efficient use of lifted cover inequalities and lifted GUB cover inequalities in a branch and cut algorithm for 0-1 integer programming. We have tried various strategies on several test problems and we identify the best ones for use in practice.
No takes yet. Share an insight, caveat, or question.
Gu et al. (1998) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: