Upper and lower bounding strategies for the generalized minimum spanning tree problem
Article Abstract:
Two stochastic heuristics for solving generalized minimum spanning tree problem (GMST) are presented. These methods are developed using the concepts of genetic algorithm and greedy search algorithm.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
Operational research techniques in medical treatment and diagnosis: a review
Article Abstract:
Issues relating to operational research techniques and their usage in medical diagnostics and treatment are examined in detail.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
The vertex degrees of minimum spanning trees
Article Abstract:
The problem of the minimum spanning trees with degree constraints is examined.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Lower-bounding procedures for the 2-dimensional cell suppression problem. A new relaxation method for the generalized minimum spanning tree problem
- Abstracts: An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem. Tabu search for DNA sequencing with false negatives and false positives