Three new heuristics for the Steiner problem in graphs.
Diané, M., Plesník, Ján (1991)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Diané, M., Plesník, Ján (1991)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Ján Plesník (1981)
Mathematica Slovaca
Similarity:
Mirko Vujošević, Milan Stanojević (2003)
The Yugoslav Journal of Operations Research
Similarity:
Guangting Chen, Rainer E. Burkard (2003)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper, we study the problem of computing a minimum cost Steiner tree subject to a weight constraint in a Halin graph where each edge has a nonnegative integer cost and a nonnegative integer weight. We prove the NP-hardness of this problem and present a fully polynomial time approximation scheme for this NP-hard problem.
Zoran Stanić (2006)
Publications de l'Institut Mathématique
Similarity:
Dionisio Pérez-Brito, Nenad Mladenović, José A. Moreno-Pérez (1998)
The Yugoslav Journal of Operations Research
Similarity:
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity:
Zsakó, László (2006)
Annales Mathematicae et Informaticae
Similarity:
Alain Guénoche, Bruno Leclerc (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A method to infer -trees (valued trees having as set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2-3 distance values between the elements of , if they fulfill some explicit conditions. This construction is based on the mapping between -tree and a weighted generalized 2-tree spanning .
Sun, Ling-li (2007)
Applied Mathematics E-Notes [electronic only]
Similarity:
Bryant Julstrom (2004)
International Journal of Applied Mathematics and Computer Science
Similarity:
The features of an evolutionary algorithm that most determine its performance are the coding by which its chromosomes represent candidate solutions to its target problem and the operators that act on that coding. Also, when a problem involves constraints, a coding that represents only valid solutions and operators that preserve that validity represent a smaller search space and result in a more effective search. Two genetic algorithms for the leaf-constrained minimum spanning tree problem...