Skip to main content
University of Nebraska Omaha logo University of Nebraska Omaha
APPLY MY UNO DIRECTORY

University of Nebraska Omaha logo
College of Arts and Sciences Department of Mathematical and Statistical Sciences
APPLY MY UNO DIRECTORY
  • About Us Backback to Main menu
    • About Us
    • Contact Us
    • Faculty & Staff Directory
    • Undergraduate Colloquia & Socials
    • Mathematics Faculty Resources
    • Upper Level Electives - Fall 2022
  • Academics Backback to Main menu
    • Undergraduate & Graduate Programs
    • Minor in Math
    • Knowledge & Skills Gained
    • Academic Advising
    • Forms for Students
    • University General Education Options
    • Math Placement & ALEKS Exam
    • Permission Number Request Form
  • Student Opportunities Backback to Main menu
    • Student Opportunities
    • Scholarships & Financial Aid
    • Student Organizations
    • Career Opportunities
    • Study Mathematics Abroad
    • Internships
    • Fast Track Program
    • Making Art with Math
  • Community Engagement Backback to Main menu
    • Community Engagement
    • Dual Enrollment in Math
    • Data Science
    • Problem of the Week and Solutions
  • Research Backback to Main menu
    • Research Areas
    • Recent Publications
  • MatheMavericks Zone
  • SIGMAA on RUME Backback to Main menu
    • Conference Information
    • Registration and Accommodations
    • Conference Program
    • About Us/Contact Us
  • Support Us

Fabio Vitor

  1. UNO
  2. College of Arts and Sciences
  3. Department of Mathematical and Statistical Sciences
  4. About Us
  5. Faculty & Staff Directory
  6. Fabio Vitor
Fabio Vitor, PhD

Fabio Vitor, PhD

  • Assistant Professor
  • DSC 239 / 402.554.2691

email:
ftorresvitor@unomaha.edu
area of focus:
  • Operations Research, Optimization Modeling, Mathematical Programming, Optimization Algorithms

Additional Information

Education

Ph.D., Industrial Engineering, Kansas State University, 2019
M.S., Operations Research, Kansas State University, 2015
B.S., Industrial Engineering, Maua Institute of Technology, 2013

Research Interests

Operations Research
Optimization Modeling
Mathematical Programming
Optimization Algorithms

Academic and Professional Experience
Fabio joined the department of Mathematics at the University of Nebraska at Omaha as an Assistant Professor in 2019. He received a Ph.D. in Industrial Engineering and a M.S. in Operations Research from Kansas State University, and a B.S. in Industrial Engineering from Maua Institute of Technology, Brazil. Fabio also has around 10 years of industry experience. He worked for companies such as Monsanto, Kalmar (Cargotec Corporation), and Volkswagen. He also participated in the Google Summer of Code program as a student developer.

Fabio’s research includes both theoretical and applied topics in operations research. His theoretical research creates algorithms to more quickly solve continuous and discrete optimization problems such as linear, nonlinear, and integer programs. For instance, Fabio developed multidimensional search simplex and interior point methods for linear programs as well as cutting plane techniques and branching strategies for integer programs. Some of his applied research involves the application of optimization models and other operations research tools to reduce inventory costs, improve delivery routings, optimize nursery planting allocation, improve airport operations, and create strategies to overcome human trafficking.

Fabio is a recipient of the Nebraska EPSCoR FIRST Award, which is supported by the National Science Foundation to advance the research of early-career tenure-track faculty. During his Doctoral studies, Fabio received the K-State 2025 College of Engineering Fellowship for two consecutive years. He also received several awards during the time he worked for Volkswagen, including the second place in the Best Apprentice Award. Fabio is a member of the Institute for Operations Research and the Management Sciences (INFORMS), the Institute of Industrial and Systems Engineering (IISE), the Society for Industrial and Applied Mathematics (SIAM), and the Mathematical Optimization Society (MOS).
Selected Publications

Yang Y., and Vitor F., A Double-Pivot Degenerate-Robust Simplex Algorithm for Linear Programming, International Journal of Operational Research, (in press).

Almaghrebi A., Vitor F., James K., Al Juheshi F., and Alahmad M., A Framework for Scheduling Household Charging of Electrical Vehicles, Proceedings of the 2022 IEEE Transportation Electrification Conference & Expo (ITEC), 540-545 (2022).

Bailey J. P., Easton T., and Vitor F., Octanary Polyhedral Branch and Bound for Integer Programs, International Journal of Operational Research, 43(4), 451-478 (2022).

Vitor F., and Easton T., Projected Orthogonal Vectors in Two-Dimensional Search Interior Point Algorithms for Linear Programming, Computational Optimization and Applications, 83(1), 211-246 (2022).

Meier S., and Vitor F., Developing a Discrete Event Simulation Model to Overcome Human Trafficking, Proceedings of the 2021 IISE Annual Conference, 7-12 (2021).

Kabirikopaei A., and Vitor F., Speech Recognition in Background Noise by a Convolution Neural Networks Model, Proceedings of the 2021 IISE Annual Conference, 794-799 (2021).

Vitor F., and Easton T., Approximate and Exact Merging of Knapsack Constraints with Cover Inequalities, Optimization, 70(2), 437-460 (2021).

Vitor F., and Easton T., The Double Pivot Simplex Method, Mathematical Methods of Operations Research, 87(1), 109-137 (2018).

Vitor F., The Ratio Algorithm to Solve the Optimal Basis of Two Constraint Linear Programs, Proceedings of the 2018 IISE Annual Conference, 1949-1954 (2018).

Vitor F., and Easton T., A Two Dimensional Search Primal Affine Scaling Interior Point Algorithm for Linear Programs, Proceedings of the 2018 IISE Annual Conference, 1961-1966 (2018).

Vitor F., Antunes V. A., and Chwif L., Warnings about Simulation Revisited: Improving Operations in Congonhas Airport, Proceedings of the 2016 Winter Simulation Conference, 2418-2429 (2016).

Vitor F., and Easton T., Merged Knapsack Cover Inequalities for the Multiple Knapsack Problem, Proceedings of the 2016 Industrial and Systems Engineering Research Conference, 607-612 (2016).

Additional Information

Education Research Interests Academic and Professional Experience Selected Publications

College of Arts and Sciences

  • Contact Us
  • 220 Arts & Sciences Hall
  • College Advising Office
  • College Resources
  • For Faculty and Staff
  • Math-Science Learning Center
  • The Writing Center
  • Next Steps
  • Visit UNO
  • Request Information
  • Apply for Admission
  • The UNO Advantage
  • Our City (Omaha)
  • Just For You
  • Future Students
  • Current Students
  • Work at UNO
  • Faculty and Staff
  • A-Z List
  • Popular Services and Resources
  • my.unomaha.edu
  • Academic Calendar
  • Campus Buildings & Maps
  • Library
  • Pay Your Bill
  • Course Catalogs
  • Internships & Career Development
  • Bookstore
  • MavCARD Services
  • Military-Connected Resource Center
  • Speech Center
  • Writing Center
  • Human Resources
  • Center for Faculty Excellence
  • Affiliates
  • University of Nebraska System
  • NU Foundation
  • Buffett Early Childhood Institute
  • Daugherty Water for Food Institute
  • National Strategic Research Institute
  • Peter Kiewit Institute
  • Rural Prosperity Nebraska
  1. University Policies
  2. Privacy Statement
  3. Accessibility
  1. 402.554.2800

University of Nebraska Omaha
University of Nebraska Omaha, 6001 Dodge Street, Omaha, NE, 68182
  • © 2023  
  • Emergency Information Alert
  • Report an Incident or Concern

Omaha Skyline

Our Campus. Otherwise Known as Omaha.

The University of Nebraska does not discriminate based on race, color, ethnicity, national origin, sex, pregnancy, sexual orientation, gender identity, religion, disability, age, genetic information, veteran status, marital status, and/or political affiliation in its education programs or activities, including admissions and employment. The University prohibits any form of retaliation taken against anyone for reporting discrimination, harassment, or retaliation for otherwise engaging in protected activity. Read the full statement.

scroll to top of page