Biography

Dr. Todd Easton

Industrial and Manufacturing Systems Engineering

Kansas State University, USA

Associate Professor


Email: teaston@ksu.edu


Research fields

Integer Programming

Network Flows

Simulation


Qualifications

1999 Ph.D., Ind. and Sys. Eng. Georgia Institute of Technology, USA

1994 M.S., Operations Research, Stanford University, USA

1993 B.S., Mathematics, Brigham Young University, USA


Publications (selected)

  1. T. Easton and J. Lee (2012) “Quaternary Hyperplane Branching with Internally Generated Cutting Planes for Solving Integer Programs,”The International Journal of Operations ResearchV 14 N 3, 366-385.
  2. Hopkins M., A. Pahwa, T. Easton (2012) “Intelligent Dispatch for Distributed Renewable Resources,” IEEE transaction on Smart Grid, V 3 N 2, 1047-1054.
  3. Easton T., K. Carlyle, J. Anderson and M. James (2011) “Simulating the Spread of an Epidemic in a Small Rural Kansas Town”International Journal of Artificial Life Research, 2 (2)95-104.
  4. Ben-Arieh, D. and T. Easton , “Product Design Compromise Using Consensus Models”, Herrera-Viedma E., Garcia-Lapresta L., Kacprzyk J., Fedrizz M., Nurmi H., and Zadrozny S., (Eds.)., inConsensual Processes: Studies in Fuzziness and Soft Computing Vol 267, 2010 pp. 405-423, Springer-Verlag.
  5. K. Huschka, J.R. English, T. Easton, and A. Huschka, Monitoring Inventory Accuracy with Statistical Process Control, Progress in Material Handling Research: 2010,Editors K. Ellis, K. Gue, R. Koster, R. Meller,B. Montreul, M. Ogle, Material handling Institute of America, 92-111, Material Handling Institute.
  6. Scoglio, C.,W. Schumm, P. Schumm, M. Youssef, A. Sydney, S. Roy Chowdhury, T. Easton (2010) Efficient mitigation strategies to control epidemics in rural regions, PLoSOne5(7) July 14, 2010 e11569. doi:10.1371/journal.pone.0011569.
  7. T. Easton, The When Diet: Mathematically Optimizing Eating and Exercise for Weight Loss, Ithaca Press, Ithaca, NY 2009 ISBN 978-0-9815116-5-8.
  8. D. Ben-Arieh,T. Eastonand B. Evans, “Minimum costs consensus with quadratic cost functions,” IEEE Transactions on Systems, Man and Cybernetics Part A: Systems and Humans, V 39 N 1, January 2009 210-217.
  9. T. Easton and A. Singireddy, “A Large Neighborhood Search Heuristic for the Longest Common Subsequence Problem,” Journal of HeuristicsV 14 N 3, June 2008 271-283.
  10. T. Easton and K. Hooker, “Simultaneously Lifting Sets of Binary Variables into Cover Inequalities for Knapsack Polytopes,” Discrete Optimization,Special Issue: In Memory of George B. Dantzig, V 5, N 2, May 2008, 254-261.
  11. Ben-Arieh, D. andT. Easton, “Multi-Criteria Group Consensus under Linear Cost Opinion Elasticity,” Decision Support Systems,V 43 N 3, Apr 2007 713-721.
  12. Schumm, P., C. Scoglio, T. Easton, D. Gruenbacher “Epidemic Spreading on Weighted Contact Networks” Proceedings of IEEE/ACM Bionetics 2007, Budapest, Hungary, Dec. 2007
  13. T. Easton and A. Singireddy, “A Specialized Branching and Fathoming Technique for the Longest Common Subsequence Problem,” The International Journal of Operations Research V 4, N 2, 200798-104.
  14. K. Hooker andT. Easton, “Using Hyperstars to Create Facial Defining Inequalities of General Binary Integer Programs,” The International Journal of Operations Research V 4, N 3, 2007, 138-145.
  15. E. K. Lee, T. Easton and K Gupta, “Novel evolutionary models and applications to sequence alignment problems.”Operations Research in Medicine -- Computing and Optimization in Medicine and Life Sciences, 148, 2006 167-187.
  16. T. Easton, K. Hooker and E. K. Lee, “Facets of the Independent Set Polytope,” Mathematical Programming, Series B 98, No. 1-3, 2003, 177-199.
  17. Horton, S. B.,T. Eastonand R. G. Parker “The Linear Arrangement Problem on Recursively Constructed Graphs” Networks,Volume 42, Issue 3, 2003, 165-168.


Profile Details

http://www.imse.ksu.edu/people-faculty-teaston

Free SCIRP Newsletters
Copyright © 2006-2024 Scientific Research Publishing Inc. All Rights Reserved.
Top