This gives rise to a convex body containing the vertex packing polytope of the graph. This body is a polytope if and only if the graph is perfect.
We shall call the solution set of (1.1) + (1.4) the fractional vertex packing polytope of the graph G and denote it by FVP(G). To get a better description of ...
This gives rise to a convex body containing the vertex packing polytope of the graph. This body is a polytope if and only if the graph is perfect. As an ...
A polynomially computable upper bound for the weighted independence number of a graph is studied. This gives rise to a convex body containing the vertex ...
Relaxations of vertex packing · Contents. Journal of Combinatorial Theory Series B Volume 40, Issue 3 · PREVIOUS ARTICLE. A survey of the asymptotic behaviour ...
People also ask
What is vertex packing?
What is the meaning of the vertex of a graph?
What is the end vertex of a graph?
In recent years valid inequalities from vertex packing relaxations have been shown to be valuable in deriving cutting planes for 0-1 integer programming, see ...
Grötschel, M., Lovász, L., & Schrijver, L. (1986). Relaxations of vertex packing. Journal of Combinatorial Theory - Series B, 40, 330–343.
There is a natural vertex packing relaxation of MVP, defined on the subgraph induced by the binary vertices. Valid inequalities for this vertex packing ...
We study a generalization of the vertex packing problem having both binary and bounded continuous variables, called the mixed vertex packing problem (MVPP).
Relaxations of vertex packing ; Year of publication: 1984 ; Authors: Grötschel, M. ; Lovász, L. ; Schryver, A. ; Publisher: Bonn : Inst., Univ. ; Subject: ...