# 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)?

New contributor
DSPinfinity is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.

Is this the formulation that you are looking for:

Min-degree constrained minimum spanning tree problem: New formulation via Miller–Tucker–Zemlin constraints

• This is irrelevant. – DSPinfinity Jan 12 at 15:01