Areas of Expertise and Professional Experience
EDUCATION |
||||
| Institution | Degree | Years | Address | |
| Cornell University | Ph.D. Operations Research | 84-86 | Ithaca, NY | |
| (Minors: Comp. Sci., Math.) | ||||
| Cornell University | MS Operations Research | 82-84 | Ithaca, NY | |
| Carleton University | B.Sc. Mathematics & Comp. Sci. | 78-82 | Ottawa, CAN | (First Class Honours) |
AREAS OF EXPERTISE |
| Combinatorial/Network Optimization, Integer Programming, Linear Programming, Telecommunications |
PROFESSIONAL EXPERIENCE |
|
| 8/95-1/98 | Director of Optimization Group, US WEST Advanced Technologies |
| Direct group of Operations Research professionals in the development of optimization algorithms for U S WEST. | |
| 9/93-8/95 | Member of Technical Staff, US WEST Advanced Technologies |
| Duties included the development of algorithms for network optimization problems. Developed algorithms for technologies including SONET, ATM, and Circuit Switched Dynamic Routing. These algorithms are incorporated into software tools. | |
| 1993-5/95 | Associate Professor of Mathematics (with tenure), University of Colorado at Denver |
| 1986-1993 | Assistant Professor of Mathematics, University of Colorado at Denver |
| 1982-1986 | NSERC Graduate Fellow, Department of Operations Research, Cornell University |
| 1/1982 - 7/1982 | Software Design (Future Communications Planning), Bell-Northern Research, Ottawa. |
| 1980-1981 | Summer Employee, Software Design, Bell-Northern Research, Ottawa. |
| 1988-1993 | Consulting (Math Clinic): Network Optimization for US WEST Advanced Technologies |
| 1992 | Consulting: Cutting Stock Algorithms for International Paper Company |
AWARDS |
|
| 1994 | Part of team receiving ORSA Industry Award |
| 1994 | Colorado Advanced Software Inst. Exemplary Researcher Award |
| 1993 | Colorado Advanced Software Inst. Exemplary Researcher Award |
| 1992 | Colorado Advanced Software Inst. Exemplary Researcher Award |
| 1991 | University of Colorado at Denver Faculty Development Award |
| 1990 | College of Liberal Arts and Sciences Teaching Excellence Award |
| 1982-1986 | NSERC Graduate Fellowship (Canadian version of NSF) |
| 1982-1986 | Cornell University Tuition Fellowship |
| 1982 | Carleton University Senate Medal for Outstanding Academic Achievement |
| 1978-1982 | Various Carleton University Fellowships |
COMPUTER SKILLS |
|
| Operating Systems: | UNIX, Windows, Dos and Macintosh. |
| Programming Languages: | C++,C, FORTRAN, and Pascal. |
List of Publications
Refereed Publications
Heuristics for Efficient Classification, with Kathryn Fraughnaugh and Holly Zullo, Annals of Operations Research (1997).
A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination, with Djangir Babayev and Fred Glover, ORSA Journal on Computing, 9, 43-50 (1997).
Coloring by Tabu Branch and Bound, with Fred Glover and Mark Parker, Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, David S. Johnson and Micheal A. Trick (eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science,26, 285-307 (1996).
IIS-Hypergraphs, SIAM Journal on Discrete Applied Mathematics 9, 643-653 (1996).
Branch and Cut Algorithms for the Steiner Tree-Star Problem, with Yuping Qiu and Youngho Lee, ORSA Journal on Computing 8, 194-201 (1996).
Finding the Minimum Weight IIS Cover of an Infeasible System of linear inequalities, with Mark Parker, Annals of Mathematics and Artificial Intelligence 17, 107-126 (1996).
Testing Integer Knapsacks for Feasibility, with Paul Hansen, European Journal of Operations Research 88, 578-582 (1996).
Tournament Games and Positive Tournaments, with David Fisher, Journal of Graph Theory 19 217-236 (1995).
Tournament Games and Condorcet Voting, with David Fisher, Linear Algebra and its Applications, 217, 87-100 (1995).
The Depth and Width of Local Minima in Discrete Solution Spaces, Discrete Applied Mathematics 56, 75-82 (1995).
Probabilities within Optimal Strategies for Tournament Games, with David Fisher, Discrete Applied Mathematics 56, 87-92 (1995).
Weyl-Minkowski Duality for Integral Monoids, with L.E. Trotter, Optimization 28, 315-331 (1994).
Fractional Domination of Strong Direct Products, with David Fisher, Gayla Domke, and Aniket Majumbdar, Discrete Applied Mathematics 50, 89-91 (1994).
Local Bipartite Turan Graphs and Graph Partitioning, with Jon Lee, Networks 24, 131-145 (1994).
A Column Generation Algorithm for Bandwidth Packing, with Mark Parker, Telecommunications Systems 2, 185-195 (1994).
A Primal-Dual Integer Programming Algorithm, with Donna C. Llewellyn, Discrete Applied Mathematics 45, 261-276 (1993).
A Permutation--Based Tabu Search for Path Assignment, with Charlie Anderson and Kathryn Jones, Annals of Operations Research 40, 299 - 312 (1993).
A Column Generation Algorithm for Finding Fractional Colorings of Random Graphs, with Melanie Marchant and David Fisher, Congressus Numerantium 89, 245 - 253 (1992).
Bounds on the Root of a Matching Polynomial, with David Fisher, Discrete Mathematics 110, 275-279 (1992).
Optimal Strategies for a Generalized Scissors, Paper and Stone Game, with David Fisher, American Mathematics Monthly 99, 935-942 (1992).
Bounds on the Number of Complete Subgraphs in a Graphs, with David Fisher, Discrete Mathematics 103, 113-120 (1992).
Matroid Algorithms and Applications, with Jonathan Lee, ORSA Journal on Computing 4, 70-98 (1992).
Transversals of IIS-Hypergraphs, Congressus Numerantium 81, 17-22 (1991).
Tabu Search for Designing a Network for a New Service, with Fred Glover and Micheal Lee, Annals of Operations Research 33, 351-362 (1991).
A 2-Dimensional Genetic Algorithm for the Ising Problem, with Kathy Jones and Charlie Anderson, Journal of Complex Systems 5, 327-333 (1991).
Totally Colouring a Graph with Maximum Degree Four, with Kathryn F. Jones, Ars Combinatoria 31, pp. 277-286 (1991).
A Decomposition of Integral Monoids, Linear Algebra and its Applications 153, pp. 209-217 (1991).
Fractional Total Colouring , Discrete Applied Mathematics 27, pp. 287-292 (1990).
Identifying Minimally Infeasible Subsytems, with John Gleeson, ORSA Journal on Computing, 2, #1, pp. 61-67 (1990).
The Constraints of the Group of a Monoid, Linear Algebra and its Applications, 139, pp. 285-292 (1990).
The Structure of an Integral Monoid and Integer Programming Feasibility, Discrete Applied Mathematics 28, pp. 251-264 (1990).
Conjectures on the Number of Complete Subgraphs in a Graph, with David Fisher, Congressus Numerantium, 70, pp. 217-221 (1989).
Unrefereed Publications
Heuristics for Classification, with Kathryn Fraughnaugh and Holly Zullo, Proceedings of IEEE SMC Conference, October (1994).
Assigning Time Slots and Routes to DS1 Traffic on a SONET Ring, with Youngho Lee, Yuping Qiu and Xiaorong Sun, U S WEST Technologies Technical Report, T-09\_10-003358-01.00 (1994).
Efficient Hueristics for Classification, with Kathryn Fraughnaugh and Holly Zullo, Colorado Advanced Software Institute Technical Report, CASI- TR-94-04 (1994).
MIP Formulation for Routing DS1 Traffic on a SONET Ring, with Yuping Qiu, Xiaorong Sun, and Youngho Lee, U S West Technologies Technical Report, T-09\_10-003060-01.00, (1994).
Integrated Heuristics For Network Optimization, with Kathryn Fraughnaugh and Mark Parker, Colorado Advanced Software Institute Technical Report, CASI-TR-93-01 (1993).
Heuristics for Network Optimization, with Kathryn Jones and Mark Parker, Colorado Institute of Artificial Intelligence Technical Report, CASI-TR-92-04 (1992).
Using AI Techniques to Solve Hard Combinatorial Optimization Problems, AI Colorado, Vol. 3, No. 2, (1991).
Tabu Search and Genetic Algorithms for Network Optimization, with Kathryn Jones, Colorado Institute of Artificial Intelligence Technical Report, CIAI-TR-91-0 (1991)2
Integral Monoid Duality Models, Cornell University Technical Report, \#711 (1986).
Book Reviews
A Review of ``Genetic Algorithms for Optimization and Machine Learning'', by D. Goldberg, ORSA Journal on Computing 3, No. 2 (1991).
U.S. Patents
Method for Assigning Inter-nodal Traffic Loads to Channels in SONET Rings. Co-inventors Yuping Qiu, Xiaorong Sun and Youngho Lee. Patent Number 5,564,021, Oct. 8, 1996.
Methods and Systems for Dynamic Routing in a Switched Communications Network. Co-inventors George Pillsbury, Rudy Zubiate and Yuping Qiu. Patent Number 5,615,254, March 25, 1997.