peer-reviewed
// research
Methods with structure
I am especially interested in methods that preserve the structure of hard combinatorial and temporal problems while still benefiting from modern data-driven techniques.
lseman@portfolio:~$ cat README.md
Laio O. Seman|
# profile metadata
roleresearcher · lecturer
stackOR · ML · forecasting
affiliationUFSC · Spacelab
statusbuilding research software
$ echo "▋"
I build optimization algorithms, forecasting models, research software, and interactive teaching artifacts for people working with complex decision systems.
$ explore teaching materials →
Optimization is the art of saying no — to suboptimal solutions, to wasted cycles, to elegant but impractical algorithms.
● connected
sess: 001
lang: pt-BR / en-US
# env vars
PAPERS
--
CITATIONS
--
H-INDEX
--
REPOS
--
# scope
research="Branch-and-price, decomposition, hybrid optimization, and learning-aware decision methods."
teaching="Visual explainers and computational material for optimization and machine learning."
software="Open libraries and experiments that make academic methods reusable."
about.md
I am a researcher and lecturer interested in how rigorous optimization methods and modern learning systems can work together, both as scientific tools and as practical instruments for real decision-making.
/* My work moves between theory, implementation, and explanation. I care about mathematically grounded methods, but also making them operational: software that runs well, interfaces that teach clearly, and systems that help people reason about difficult problems. */
/* Across papers, libraries, and interactive materials, I aim to make advanced topics in optimization, forecasting, and machine learning feel coherent rather than fragmented. */
open-access
// teaching
Clarity through interaction
As a lecturer, I value explanations that are visual, tactile, and computational, turning abstract models into things students can inspect, manipulate, and test.
oss
// software
Research that ships
I see software as a research output in its own right: a way to share methods, accelerate experiments, and make academic ideas reusable outside a single paper.
research.log
// research domains
/* My research sits between mathematical rigor and computational experimentation, spanning exact optimization, learning systems, and predictive modeling. */
min f(x) s.t. gᵢ(x) ≤ 0, hⱼ(x) = 0 ∀i,j
[P1] General nonlinear program — the canonical form my branch-and-price solvers tackle.
exact methods
// domain: OR
Operations research
Branch-and-Price, decomposition methods, and scalable exact or hybrid strategies for hard optimization problems.
- Algorithm design for structured decision problems
- Exact methods combined with heuristics
- Implementations built for experimentation and reuse
learning systems
// domain: ML
Machine learning
Learning systems designed with awareness of optimization, combinatorics, and the demands of real decision pipelines.
- Optimization-aware machine learning
- Neural methods for structured decisions
- Graph and sequence models for complex systems
temporal models
// domain: TS
Time-series forecasting
Deep and statistical approaches for forecasting workflows, multi-step prediction, and interpretable temporal modeling.
- Neural architectures for temporal data
- Attention mechanisms and sequence modeling
- Forecasting systems designed to scale in practice
// wordcloud
Research topic cloud
$
wordcloud2 --source=publications.json
--output=topics.png --mode=diagonal
# generated output
Top Terms
Built from titles, abstracts, and keywords across available publications.
software.json
// selected projects
Open tools that turn research methods into reusable implementations.
C++17 · VRP
{
"name" : "baldes" ,
"what" : "Modern C++ bucket-graph labeling for vehicle routing problems" ,
"stack" : [ "C++" , "Vehicle Routing" , "OR" ]
} ↗
PyTorch · TS
{
"name" : "foreblocks" ,
"what" : "Modular PyTorch library for time-series forecasting" ,
"stack" : [ "PyTorch" , "Time Series" , "Deep Learning" ]
} ↗
C++ · Python
{
"name" : "ipym" ,
"what" : "Fast interior-point methods for linear programming with Python bindings" ,
"stack" : [ "C++" , "Python" , "LP" ]
} ↗
C++ · NLP
{
"name" : "chomp" ,
"what" : "Modular NLP solver with SQP, interior-point, and DFO-L1 strategies" ,
"stack" : [ "C++" , "NLP" , "SQP" ]
} ↗
teaching.md
Explore · Experiment · Understand
Course notes and browser-based simulations that make engineering concepts tangible. Materials are in Portuguese.
∇ × E = −∂B/∂t | ∇ × H = J + ∂D/∂t
[Maxwell] The equations your simulations bring to life — explore them interactively below.
sim-enabled
Course resources / 01
Communication systems
Study communication systems through course notes and interactive simulations.
sim-enabled
Course resources / 02
Electromagnetism
Explore electromagnetic concepts with notes and computational experiments.
sim-enabled
Course resources / 03
Electromagnetic compatibility
Connect electromagnetic compatibility concepts to interactive simulations.
repos.json
$ gh repo list lseman --limit 6
/* Selected repositories highlighting current software directions and research infrastructure. */
Loading…papers.log
Research in optimization, learning systems, and forecasting.
auto-indexed from Google Scholar
Loading…
Browse recent work below, or visit Google Scholar for my full publication record ↗.
partnerships.json
// international collaborations
collaboration_network.mapWORLD / 2D
Select an institution to trace its connection to UFSC.
socials.yml
// cat socials.yml
Open to research conversations, teaching collaborations, and software work. If you would like to discuss collaboration, student supervision, invited talks, or open-source projects, these are the best entry points.
● available
response: < 48h
→ prefer email for formal requests