Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Fabio Vitor
Observed name:
Vitor, Fabio
Institution:
University of Nebraska at Omaha
Observed institutions:
University of Nebraska at Omaha,
United States Department of Commerce,
Instituto Mauá de Tecnologia,
Kansas State University,
Huazhong University of Science and Technology,
University of Maryland, College Park
show all 6
ORCID:
0000-0002-3284-8378
Observed ORCID:
0000-0002-3284-8378
OpenAlex ID:
A5001562241
The double pivot simplex method
2017
·
Fabio Vitor
, Todd Easton
·
Mathematical Methods of Operations Research
·
20
PDF
Two Dimensional Search Algorithms for Linear Programming
2019
·
Vitor, Fabio
·
DigitalCommons@UNO
·
8
PDF
A Framework for Scheduling Household Charging of Electric Vehicles
2022
·
Ahmad Almaghrebi
, Fabio Vitor
, et al.
·
IEEE Transportation Electrification Conference and Expo
·
7
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
2022
·
Fabio Vitor
, Todd Easton
·
Computational Optimization and Applications
·
6
A Double-Pivot Degenerate-Robust Simplex Algorithm for Linear Programming
2022
·
Fabio Vitor
, Yaguang Yang
·
International Journal of Operational Research
·
3
Approximate and exact merging of knapsack constraints with cover inequalities
2020
·
Fabio Vitor
, Todd Easton
·
Optimization
·
2
PDF
Warnings about simulation revisited: Improving operations in Congonhas Airport
2016
·
Fabio Vitor
, Vanessa Antunes Santos
, et al.
·
Winter Simulation Conference
·
2
Improving the solution time of integer programs by merging knapsack constraints with cover inequalities
2015
·
Fabio Vitor
·
DigitalCommons@UNO
·
2
PDF
Building a Framework to Schedule Courses at Community Colleges Based on Student Success by Using Binary Integer Programming
2025
·
Fabio Vitor
, Joseph Bonacci
·
Community College Journal of Research and Practice
A double-pivot degenerate-robust simplex algorithm for linear programming
2025
·
Yaguang Yang
, Fabio Vitor
·
International Journal of Operational Research
PDF
Two-set inequalities for the binary knapsack polyhedra
2024
·
Todd Easton
, Jennifer Tryon
, et al.
·
Discrete Optimization
Octanary polyhedral branch and bound for integer programs
2022
·
James P. Bailey
, Todd Easton
, et al.
·
International Journal of Operational Research
A double-pivot degenerate-tolerable simplex algorithm for linear programming
2021
·
Yaguang Yang
, Fabio Vitor
·
arXiv (Cornell University)
Octanary Polyhedral Branch and Bound for Integer Programs
2020
·
Fabio Vitor
, James P. Bailey
, et al.
·
International Journal of Operational Research
Show more works
View as search
Works count:
15
Citation count:
51
H-index:
4
I10-index:
1
Year
Topic
Type