# k -MST problem based on Miller-Tucker-Zemlin subtour elimination constraints

Where can I find the formulation of the $$k$$-MST ($$k$$-minimum spanning tree) problem as (mixed) integer linear program based on Miller-Tucker-Zemlin subtour elimination constraints (MTZ)?