Communication Network Design. The availability of fiber optics and increasing demand for two-way audiovisual communication and interactive television has necessitated the study of feasible fiber optic communication network design for homes. This study develops optimization models for determining optimal network configurations. Project Networks and Time-Cost Tradeoff Problems. In this work several algorithms are being developed for solving time-cost tradeoff problems.
Heuristic procedures are under development.
The Greedy Algorithm and Coxeter Matroids. Matroids are the natural setting for the greedy algorithm because the greedy algorithm solves the combinatorial optimization problem of finding the independent set with greatest total weight. There is, associated with Coxeter matroids, a combinatorial opitimization problem that is also solved by the greedy algorithm.