Person: Dale A. Schoenefeld

DBLP: Schoenefeld:Dale_A=

Contributed to:

1999

1998

1997

1996

1995

1994

Wrote 11 papers:

SAC-1999-CraneWS #algorithm #multi #pipes and filters #scheduling #search-based #using

Scheduling of Multi-Product Fungible Liquid Pipelines Using Genetic Algorithms (DSC, RLW, DAS), pp. 280–285.

SAC-1998-CookSW

Finding rural postman tours (CC, DAS, RLW), pp. 318–326.

SAC-1997-ChristensenWS #algorithm #hybrid #multi #problem

A hybrid algorithm for the point to multipoint routing problem (HLC, RLW, DAS), pp. 263–268.

SAC-1996-AbualiWS #algorithm #design #problem #search-based #set #using

Solving the subset interconnection design problem using genetic algorithms (FNA, RLW, DAS), pp. 299–304.

SAC-1996-HoeltingSW #algorithm #network #search-based #using

Finding investigator tours in telecommunication networks using genetic algorithms (CJH, DAS, RLW), pp. 82–87.

SAC-1996-HoeltingSW96a #algorithm #precedence #problem #search-based #using

A genetic algorithm for the minimum broadcast time problem using a global precedence vector (CJH, DAS, RLW), pp. 258–262.

SAC-1995-AbualiWS #encoding #graph #representation

Determinant factorization and cycle basis: encoding schemes for the representation of spanning trees on incomplete graphs (FNA, RLW, DAS), pp. 305–312.

SAC-1995-AbualiWS95a #algorithm #morphism #problem #search-based #using

Solving the three-star tree isomorphism problem using genetic algorithms (FNA, RLW, DAS), pp. 337–344.

SAC-1995-HoeltingSW #approximate #problem

Approximation techniques for variations of the p-median problem (CJH, DAS, RLW), pp. 293–299.

SAC-1994-AbualiSW #algorithm #design #network #probability #search-based #using

Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees (FNA, DAS, RLW), pp. 242–246.

SAC-1994-FogelsongDS #framework #library #reuse

Graphics class library for plotting (GCLIP), an extensible, reusable graphics framework (BAF, SD, DAS), pp. 64–69.