Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Fabio Vitor"'
Autor:
Fabio Vitor, Todd Easton
Publikováno v:
Computational Optimization and Applications. 83:211-246
A descrição da nova espécie para o Brasil, Cheilolejeunea savannae L.P. Macedo, Ilk.-Borg. & C.J. Bastos, suscitou a necessidade de rever muitos espécimes identificados previamente como Cheilolejeunea intertexta (Lindenb.) Steph., objetivando o r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56c6fc3e349f5480597c05c6721dedc0
https://doi.org/10.1590/2236-8906-54/2022
https://doi.org/10.1590/2236-8906-54/2022
Autor:
Fabio Vitor
Publikováno v:
Encyclopedia of Data Science and Machine Learning ISBN: 9781799892205
Optimization is an important tool for decision makers to make better and more informed decisions. Most algorithms designed to solve optimization models are considered one-dimensional search methods. That is, an improved solution is obtained at each i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9aa917e4078b971ecb751ec41d7c0188
https://doi.org/10.4018/978-1-7998-9220-5.ch144
https://doi.org/10.4018/978-1-7998-9220-5.ch144
Publikováno v:
2022 IEEE Transportation Electrification Conference & Expo (ITEC).
Autor:
Fabio Vitor, Todd Easton
Publikováno v:
Optimization. 70:437-460
This paper presents both approximate and exact merged knapsack cover inequalities, a class of cutting planes for knapsack and multiple knapsack integer programs. These inequalities combine the info...
Autor:
Fabio Vitor, Yaguang Yang
A double pivot algorithm that combines features of two recently published papers by these authors is proposed. The proposed algorithm is implemented in MATLAB. The MATLAB code is tested, along with a MATLAB implementation of Dantzig's algorithm, for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6c0dc3fc9162c0f089a21d9c607faef
Publikováno v:
International Journal of Operational Research. 43:451
Autor:
Fabio Vitor, Todd Easton
Publikováno v:
Mathematical Methods of Operations Research. 87:109-137
The simplex method, created by George Dantzig, optimally solves a linear program by pivoting. Dantzig’s pivots move from a basic feasible solution to a different basic feasible solution by exchanging exactly one basic variable with a nonbasic varia
Autor:
Fabio Vitor
Publikováno v:
Fabio Vitor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8b82b0299e1891a903785f9a6d5daca