A simulated annealing approach for the capacitated minimum spanning tree problem

Presents a novel approach to solve an NP-complete problem that is very important from the theoretical and practical point of view, namely the capacitated minimum spanning tree (CMST) problem. This approach has the following features: (a) it is based on the simulated annealing (SA) algorithm; (b) it...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Torres-Jimenez, J., Pinto-Elias, R., Garcia-Romero, A.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Automotive engineering Conducting materials Constraint theory Costs Heuristic algorithms NP-complete problem Read only memory Roads Simulated annealing Testing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!