A weight-coded genetic algorithm for the minimum weight triangulation problem

Authors:
Kerry Capp;Bryant A. Julstrom
Affiliations:
Information Systems Department, National Marrow Donor Program, Minneapolis, MN;Department of Computer Science, St. Cloud State University, St. Cloud, MN
Venue:
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Year:
1998

Citing 5
Cited 3

Computational geometry in C

Computational geometry in C
New algorithms and empirical findings on minimum weight triangulation heuristics (extended abstract)

Proceedings of the eleventh annual symposium on Computational geometry
Representing rectilinear Steiner trees in genetic algorithms

SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
The Greedy and Delauney Triangulations are not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-Connected Polygons is NP-Complete

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
High-Speed Cryptography

ISW '97 Proceedings of the First International Workshop on Information Security

A weight-coded genetic algorithm for the multiple container packing problem

Proceedings of the 1999 ACM symposium on Applied computing
A weight-coded genetic algorithm for the capacitated arc routing problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Approximations on Minimum Weight Triangulations and Minimum Weight Pseudo-Triangulations Using Ant Colony Optimization Metaheuristic

Fundamenta Informaticae - Emergent Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract