4
$\begingroup$

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

$\endgroup$
1
$\begingroup$

Is this the formulation that you are looking for:

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

Source: http://yoksis.bilkent.edu.tr/pdf/files/10.1016-j.cor.2009.03.006.pdf

$\endgroup$
1
  • $\begingroup$ This is irrelevant. $\endgroup$ Jan 12 at 15:01

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.