The precedence constrained knapsack problem: Separating maximally violated inequalities

Artículo de publicación ISIWe consider the problem of separating maximally violated inequalities for the precedence constrained knapsack problem. Though we consider maximally violated constraints in a very general way, special emphasis is placed on induced cover inequalities and induced clique inequalities. Our contributions include a new partial characterization of maximally violated inequalities, a new safe shrinking technique, and new insights on strengthening and lifting. This work follows on the work of Boyd (1993), Park and Park (1997), van de Leensel et al. (1999) and Boland et al. (2011). Computational experiments show that our new techniques and insights can be used to significantly improve the performance of cutting plane algorithms for this problem.FONDECYT grants 1110024 1110674 ANILLO grant ACT-88 Basal project CMM (Universidad de Chile) ICM grant P10-024-