Roberto Solis-Oba

Roberto Solis-Oba works on designing and analyzing algorithms for combinatorial optimization problems—mathematical puzzles about how to best arrange, schedule, or select items under constraints. Much of the work focuses on developing approximation algorithms (methods that find provably near-optimal solutions efficiently when exact solutions are computationally hard to obtain) for problems like scheduling on machines, packing rectangles into strips, cutting graphs, and route planning (such as the 'thief orienteering problem', which combines route selection with item collection under weight/time limits). This research is largely theoretical, aiming to prove performance guarantees and complexity results for these algorithms.

Publication output has remained relatively steady over the last decade, with modest year-to-year fluctuations and no clear long-term increase or decline, averaging about 2-3 papers per year recently.

Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026