// 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
# profile metadata
$ echo "▋"
I build optimization algorithms, forecasting models, research software, and interactive teaching artifacts for people working with complex decision systems.
# env vars
# 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."
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. */
// research
I am especially interested in methods that preserve the structure of hard combinatorial and temporal problems while still benefiting from modern data-driven techniques.
// teaching
As a lecturer, I value explanations that are visual, tactile, and computational, turning abstract models into things students can inspect, manipulate, and test.
// software
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 domains
/* My research sits between mathematical rigor and computational experimentation, spanning exact optimization, learning systems, and predictive modeling. */
// domain: OR
Branch-and-Price, decomposition methods, and scalable exact or hybrid strategies for hard optimization problems.
// domain: ML
Learning systems designed with awareness of optimization, combinatorics, and the demands of real decision pipelines.
// domain: TS
Deep and statistical approaches for forecasting workflows, multi-step prediction, and interpretable temporal modeling.
// wordcloud
Built from titles, abstracts, and keywords across available publications.
// selected projects
$ cat software.json | jq '.'
{
"name" : "baldes" ,
"what" : "Modern C++ bucket-graph labeling for vehicle routing problems" ,
"stack" : [ "C++" , "Vehicle Routing" , "OR" ]
} ↗
{
"name" : "foreblocks" ,
"what" : "Modular PyTorch library for time-series forecasting" ,
"stack" : [ "PyTorch" , "Time Series" , "Deep Learning" ]
} ↗
{
"name" : "ipym" ,
"what" : "Fast interior-point methods for linear programming with Python bindings" ,
"stack" : [ "C++" , "Python" , "LP" ]
} ↗
{
"name" : "chomp" ,
"what" : "Modular NLP solver with SQP, interior-point, and DFO-L1 strategies" ,
"stack" : [ "C++" , "NLP" , "SQP" ]
} ↗
$ gh repo list lseman --limit 6
/* Selected repositories highlighting current software directions and research infrastructure. */
Loading…$ git log --oneline --graph --all ./papers
// 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.