Minimum spanning
k -Node Minimum Spanning Tree
Formulate the k -MST problem as (mixed) integer linear programs (MILPs), based on:
1- Miller-Tucker-Zemlin subtour elimination constraints (MTZ)
2- single commodity flows (SCF)
3- multi commodity flows (MCF)
Taggings:
