Become a sponsor to Ugur Arikan
Uğur Arıkan
I work at the intersection of operations research, data science, and Rust software engineering. I build optimization and decision-support systems, production software for computationally demanding problems, and reusable open-source crates with a focus on clarity, performance, and practical use.
| github | email | linkedin | crates | sponsor |
About
I am an operations research and data science professional who focuses on mathematical optimization, network and routing problems, decision-support systems, and research-backed engineering. I also build software in Rust, Python, C#, TypeScript/React, and SQL when the problem benefits from those tools.
My work is split across two main tracks:
- OR and data science for planning, optimization, simulation, and decision support.
- Rust and systems software for high-performance components, concurrency, parallel computation, and reusable libraries.
OR and data science
I apply optimization in practice across network design, routing, facility location, capacity allocation, freight and loading problems, and scenario analysis. The goal is always the same: make the model precise, make the implementation reliable, and make the result useful for real decisions.
Selected references:
- Composing Zero-Cost Abstractions in Route Optimization — a talk at the intersection of OR and Rust.
- orxfun notes — technical writing on ideas behind the work.
- math modeling library 🔎 — a C# mathematical modeling library to draft the idea, being reworked with Rust
Rust and systems software
I use Rust for production-grade optimization components, concurrent data structures, and reusable crates. Rust is especially useful when I need performance, memory safety, and strong abstractions together. I also use Python, C#, and TypeScript/React around those components when the broader system benefits from it.
Representative crates and projects:
- orx-parallel — a configurable parallel computation library.
- orx-concurrent-vec — a concurrent counterpart to
Vec. - orx-tree, orx-linked-list, orx-closure, orx-network-flows — crates with distinct use cases across data structures, closures, and optimization.
- orx-local-search — composable local-search tooling for optimization.
Open source
The orx-* ecosystem is my public playground for useful libraries, experiments, and production-oriented components. Some projects emphasize concurrency and parallelism, others focus on data structures, closures, or optimization-specific modeling. I aim for crates that are small enough to understand, but serious enough to be useful in real projects.
Connect
If you want to follow the work, collaborate, propose or discuss an idea, please reach out via email, GitHub, LinkedIn, or sponsor.
Featured work
-
orxfun/orx-priority-queue
Priority queue traits and efficient d-ary heap implementations.
Rust 11 -
orxfun/orx-tree
A beautiful tree 🌳 with convenient, efficient, parallelizable growth, mutation and traversal features.
Rust 17 -
orxfun/orx-concurrent-vec
A thread-safe, efficient and lock-free vector allowing concurrent grow, read and update operations.
Rust 18 -
orxfun/orx-parallel
Performant parallel computations with an expressive iterator API.
Rust 315 -
orxfun/orx-local-search
placeholder: local search
Rust 5 -
orxfun/orx-closure
An explicit closure with absolute seperation of the captured data from the function.
Rust 39