SOLVING THE DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM USING TABU AND MODIFIED PENALTY SEARCH METHODS
In this paper we consider the Degree Constrained Minimum Spanning Tree Problem. This problem is concerned with finding, in a given edge weighted graph G (all weights are non-negative), the minimum weight spanning tree T satisfying specified degree restrictions on the vertices. This problem arises na...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Petra Christian University
2004-01-01
|
Series: | Jurnal Teknik Industri |
Subjects: | |
Online Access: | http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/16216 |