Home

Current Classes

Previous Classes

Math Links

Bio

A Bit About Your Instructor...

Work and Play

Spring 2009 marks my first semester with the MCC family.  I live in the Greater Waco area with my amazing husband, a perfect cat, two slightly-less-than-perfect dogs, and a crazy baby.  When I'm not slaving away grading quizzes and dreaming up ways to terrify my students, I run my own business and raise my aforementioned crazy baby.  I also work as a consultant for 4Frontiers Corporation, leading the effort to develop technical and functional requirements for a permanent Mars settlement.  I am also active in Toastmasters International, a nonprofit group dedicated to helping people improve their public speaking and leadership skills.  I am also active as a space advocate, and am a member of The Mars Society and am self-appointed head cheerleader of SpaceX, a private space company that tests rockets just outside of McGregor.

Technical Papers in Print

• Andreas, A. K. and Beichl, I., “Estimating the Work in Integer Partitioning,” IEEE Computing in Science and Engineering, 5 (1), January 2003, 48 - 56.

Technical Papers to Appear

• Andreas, A. K. and Smith, J. C., “Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Constraints,” to appear in INFORMS Journal on Computing.
• Andreas, A. K. and Smith, J. C., “Decomposition Algorithms for the Design of a Non-simultaneous Capacitated Evacuation Tree Network,” to appear in Networks.
• Andreas, A. K., Smith, J. C., and Küçükyavuz, S., “Branch-and-Price-and-Cut Algorithms for Solving the Reliable h-paths Problem,” to appear in Global Optimization.

General Audience Articles

• Andreas, A. K. “Engineering a Win,” The Toastmaster, August 2007.

Technical Presentations

• “Applying the Systems Engineering Process to the Development of a Permanent Mars Colony,” International Space Development Conference, Dallas, Texas, May 2007.
  “3-D Terrain-Following Radar Simulation Using Object-Oriented MATLAB,” Raytheon Processing Systems Technology Network Symposium, El Segundo, California, May 2007.
• “Computing Minimum-Cost h-Independent Paths with Reliability Considerations,” INFORMS Telecommunication Conference, Dallas, Texas, March 2006.
• “Exact Algorithms for Reliable h-Path Routing Problems,” INFORMS Conference, San Francisco, California, November 2005.
• “Exact Algorithms for Robust k-Path Routing Problems,” International Workshop on Global Optimization, Almería, Spain, September 2005.
• “Algorithms for Two-Path Routing Problems with Reliability Considerations,” Institute of Industrial Engineers Conference, Atlanta, Georgia, May 2005.
• “Solving Low-Risk, Low-Cost Routing Problems,” INFORMS Conference, Denver, Colorado, October 2004.
• “Robust Planning Problems,” Institute of Industrial Engineers Conference, Houston, Texas, May 2004.
• “Estimating the Work in Integer Partitioning,” National Institute of Science and Technology, Bethesda, Maryland, August 2003.