On the p-Median polytope

The p-Median problem defined on a complete directed graph with n nodes (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\vec{K}$\end{document}n(V,A)) asks for a subset T⊆V of cardinality p and such that the weight of n-p arcs going from T to every node of V∖T, is minimized. The p-Median polytope Mn-p(\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\vec{K}$\end{document}n(V,A)) is the convex hull of the incidence vectors of all the subsets of n-p arcs in A leaving a set T⊆V of cardinality p and entering in every node of V∖P.