Todd W. Easton
Affiliations: | Department of Industrial & Manufacturing Systems Engineering | Kansas State University, Manhattan, KS, United States |
Area:
Industrial Engineering, Operations Research, System Science EngineeringGoogle:
"Todd Easton"Children
Sign in to add trainee| Kevin J. Hooker | grad student | 2005 | Kansas State University |
| Randal E. Hickman | grad student | 2014 | Kansas State University |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Vitor F, Bailey JP, Easton T. (2021) Octanary Polyhedral Branch and Bound for Integer Programs International Journal of Operational Research. 1: 1 |
| Vitor F, Easton T. (2020) Approximate and Exact Merging of Knapsack Constraints with Cover Inequalities Optimization. 1-24 |
| Vitor F, Easton T. (2018) The double pivot simplex method Mathematical Methods of Operations Research. 87: 109-137 |
| Easton T, Becker K. (2016) Optimizing baseball defensive alignments through integer programming and simulation International Journal of Modelling and Simulation. 37: 82-87 |
| Hickman R, Easton T. (2015) Merging valid inequalities over the multiple knapsack polyhedron International Journal of Operational Research. 24: 214-227 |
| Easton T, Carlyle K, Scoglio C. (2015) Optimizing quarantine regions through ellipsoidal geographic networks Computers & Industrial Engineering. 80: 145-153 |
| Muggy L, Easton T. (2015) Generating class schedules within a complex modular environment with application to secondary schools Journal of Scheduling. 18: 369-376 |
| Easton T, Lee J. (2012) Quaternary hyperplane branching with internally generated cutting planes for solving integer programmes International Journal of Operational Research. 14: 366-385 |
| Easton T, Hooker K. (2008) Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes Discrete Optimization. 5: 254-261 |
| Easton T, Singireddy A. (2008) A large neighborhood search heuristic for the longest common subsequence problem Journal of Heuristics. 14: 271-283 |