Vertex Packings: Structural Properties and Algorithms.
Technical summary rept.,
WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Pagination or Media Count:
A sufficient local optimality condition is given for the weighted vertex packing problem. It is shown that integer-valued variables in an optimal solution to the linearization of this problem retain those same values in an optimal integer solution to the problem. An algorithm is presented and computational experience is given. Modified author abstract
- Operations Research