The mixed vertex packing problem

We study a generalization of the vertex packing problem having both binary and bounded continuous variables, called the mixed vertex packing problem ( MVPP). The well-known vertex packing model arises as a subproblem or relaxa tion of many 0-1 integer problems, whereas the mixed vertex packing model a rises as a natural counterpart of vertex packing in the context of mixed 0- 1 integer programming. We describe strong valid inequalities for the convex hull of solutions to the MVPP and separation algorithms for these inequali ties. We give a summary of computational results with a branch-and-cut algo rithm for solving the MVPP and using it to solve general mixed-integer prob lems.