Follow
Matheus J. Ota
Title
Cited by
Cited by
Year
Partitioning a graph into balanced connected classes: Formulations, separation and experiments
FK Miyazawa, PFS Moura, MJ Ota, Y Wakabayashi
European Journal of Operational Research 293 (3), 826-836, 2021
342021
Exhaustive and semi-exhaustive procedural content generation
N Sturtevant, M Ota
Proceedings of the AAAI Conference on Artificial Intelligence and …, 2018
312018
Cut and Flow Formulations for the Balanced Connected k-Partition Problem
FK Miyazawa, PFS Moura, MJ Ota, Y Wakabayashi
International Symposium on Combinatorial Optimization, 128-139, 2020
132020
Approximation and parameterized algorithms for balanced connected partition problems
PFS Moura, MJ Ota, Y Wakabayashi
Conference on Algorithms and Discrete Applied Mathematics, 211-223, 2022
52022
Combinatorial dual bounds on the least cost influence problem
RS Melo, AL Vignatti, FK Miyazawa, MJ Ota
Pesquisa Operacional 43, e275468, 2023
22023
Tighter Dual Bounds on the Least Cost Influence Problem
RS de Melo, AL Vignatti, FK Miyazawa, MJ Ota
Proceedings of the 52nd Brazilian Operational Research Symposium. SBPO, 2020
22020
Algoritmo de Branch-Cut-and-Price para o Problema do Roteamento de Veículos Capacitados
MJ Ota, FK Miyazawa, R Técnico-IC-PFG, PF de Graduação
Revista dos Trabalhos de Iniciação Científica da UNICAMP, 2018
22018
Hardness of pricing routes for two-stage stochastic vehicle routing problems with scenarios
MJ Ota, R Fukasawa
Operations Research, 2024
12024
Balanced connected partitions of graphs: approximation, parameterization and lower bounds
PFS Moura, MJ Ota, Y Wakabayashi
Journal of Combinatorial Optimization 45 (5), 127, 2023
12023
The balanced connected k-partition problem: polyhedra and algorithms= O problema da k-partição conexa balanceada: poliedros e algoritmos
MJ Ota
[sn], 2020
2020
Benders cutsvia corner polyhedra: an application to the stochasticvehicle routing problem
MJ Ota, R Fukasawa, AM Kazachkov
The system can't perform the operation now. Try again later.
Articles 1–11