An Efficient Mixed Integer Linear Programming Model for the Minimum Spanning Tree Problem
Finding a minimum spanning tree in a given network is a famous combinatorial optimization problem that appears in different engineering applications. Even though this problem is solvable in polynomial time, having efficient mathematical programming models is important as they can provide insights fo...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-09-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2227-7390/6/10/183 |