The mixed vertex packing problem |
| |
Authors: | Alper Atamtürk George L Nemhauser Martin WP Savelsbergh |
| |
Institution: | (1) School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA, US |
| |
Abstract: | 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 relaxation of many 0-1 integer
problems, whereas the mixed vertex packing model arises 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 inequalities. We give a summary of computational results with a branch-and-cut algorithm for solving
the MVPP and using it to solve general mixed-integer problems.
Received: June 1998 / Accepted: February 2000?Published online September 20, 2000 |
| |
Keywords: | Mathematics Subject Classification (1991): 90C10 90C11 90C57 |
本文献已被 SpringerLink 等数据库收录! |
|